default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Beume
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j6]Julian Togelius
, Mike Preuss, Nicola Beume, Simon Wessing, Johan Hagelbäck, Georgios N. Yannakakis, Corrado Grappiolo:
Controllable procedural map generation via multiobjective evolution. Genet. Program. Evolvable Mach. 14(2): 245-277 (2013)- 2012
- [b1]Nicola Beume:
Hypervolume based metaheuristics for multiobjective optimization. Dortmund University of Technology, 2012 - 2011
- [c17]Nicola Beume, Marco Laumanns, Günter Rudolph:
Convergence rates of SMS-EMOA on continuous bi-objective problem classes. FOGA 2011: 243-252 - 2010
- [j5]Mike Preuss, Nicola Beume, Holger Danielsiek, Tobias Hein, Boris Naujoks, Nico Piatkowski, Raphael Stür, Andreas Thom, Simon Wessing:
Towards Intelligent Team Composition and Maneuvering in Real-Time Strategy Games. IEEE Trans. Comput. Intell. AI Games 2(2): 82-98 (2010) - [c16]Julian Togelius, Mike Preuss, Nicola Beume, Simon Wessing, Johan Hagelbäck, Georgios N. Yannakakis:
Multiobjective exploration of the StarCraft map space. CIG 2010: 265-272 - [c15]Nicola Beume, Marco Laumanns, Günter Rudolph:
Convergence Rates of (1+1) Evolutionary Multiobjective Optimization Algorithms. PPSN (1) 2010: 597-606 - [c14]Simon Wessing, Nicola Beume, Günter Rudolph, Boris Naujoks:
Parameter Tuning Boosts Performance of Variation Operators in Multiobjective Optimization. PPSN (1) 2010: 728-737
2000 – 2009
- 2009
- [j4]Nicola Beume:
S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure Problem. Evol. Comput. 17(4): 477-492 (2009) - [j3]Nicola Beume, Carlos M. Fonseca, Manuel López-Ibáñez, Luís Paquete, Jan Vahrenhold:
On the Complexity of Computing the Hypervolume Indicator. IEEE Trans. Evol. Comput. 13(5): 1075-1082 (2009) - [c13]Markus Kemmerling, Niels Ackermann, Nicola Beume, Mike Preuss, Sebastian Uellenbeck, Wolfgang Walz:
Is human-like and well playing contradictory for Diplomacy bots? CIG 2009: 209-216 - [c12]Nicola Beume, Boris Naujoks, Mike Preuss, Günter Rudolph, Tobias Wagner:
Effects of 1-Greedy -Metric-Selection on Innumerably Large Pareto Fronts. EMO 2009: 21-35 - [c11]Patrick Koch, Oliver Kramer, Günter Rudolph, Nicola Beume:
On the hybridization of SMS-EMOA and local search for continuous multiobjective optimization. GECCO 2009: 603-610 - [i1]Jörg Fliege, Nicola Beume, Jürgen Branke, Heinrich Braun, Nirupam Chakraborti, Kalyanmoy Deb, Sabine Helwig, Joshua D. Knowles, Martin Middendorf, Sanaz Mostaghim, Silvia Poles, Daniel E. Salazar Aponte, Shukla Pradymn, El-Ghazali Talbi:
09041 Working Group on EMO for Robust Multiobjective Optimization (1st Round). Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j2]Nicola Beume, Boris Naujoks, Günter Rudolph:
SMS-EMOA - Effektive evolutionäre Mehrzieloptimierung (SMS-EMOA - Effective Evolutionary Multiobjective Optimization). Autom. 56(7): 357-364 (2008) - [c10]Thomas Voß, Nicola Beume, Günter Rudolph, Christian Igel:
Scalarization versus indicator-based selection in multi-objective CMA evolution strategies. IEEE Congress on Evolutionary Computation 2008: 3036-3043 - [c9]Nicola Beume, Holger Danielsiek, Christian Eichhorn, Boris Naujoks, Mike Preuss, Klaus D. Stiller, Simon Wessing:
Measuring flow as concept for detecting game fun in the Pac-Man game. IEEE Congress on Evolutionary Computation 2008: 3448-3455 - [c8]Nicola Beume, Tobias Hein, Boris Naujoks, Georg Neugebauer, Nico Piatkowski, Mike Preuss, Raphael Stür, Andreas Thom:
To model or not to model: Controlling Pac-Man ghosts without incorporating global knowledge. IEEE Congress on Evolutionary Computation 2008: 3464-3471 - [c7]Nicola Beume, Tobias Hein, Boris Naujoks, Nico Piatkowski, Mike Preuss, Simon Wessing:
Intelligent anti-grouping in real-time strategy games. CIG 2008: 63-70 - [c6]Holger Danielsiek, Raphael Stür, Andreas Thom, Nicola Beume, Boris Naujoks, Mike Preuss:
Intelligent moving of groups in real-time strategy games. CIG 2008: 71-78 - [e1]Günter Rudolph, Thomas Jansen, Simon M. Lucas, Carlo Poloni, Nicola Beume:
Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings. Lecture Notes in Computer Science 5199, Springer 2008, ISBN 978-3-540-87699-1 [contents] - 2007
- [j1]Nicola Beume, Boris Naujoks, Michael T. M. Emmerich:
SMS-EMOA: Multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3): 1653-1669 (2007) - [c5]Tobias Wagner, Nicola Beume, Boris Naujoks:
Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization. EMO 2007: 742-756 - [c4]Michael T. M. Emmerich, André H. Deutz, Nicola Beume:
Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric. Hybrid Metaheuristics 2007: 140-156 - 2006
- [c3]Nicola Beume, Günter Rudolph:
Faster s-metric calculation by considering dominated hypervolume as klee's measure problem. Computational Intelligence 2006: 233-238 - 2005
- [c2]Boris Naujoks, Nicola Beume, Michael T. M. Emmerich:
Multi-objective optimisation using S-metric selection: application to three-dimensional solution spaces. Congress on Evolutionary Computation 2005: 1282-1289 - [c1]Michael Emmerich, Nicola Beume, Boris Naujoks:
An EMO Algorithm Using the Hypervolume Measure as Selection Criterion. EMO 2005: 62-76
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-11 20:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
