The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Frank Neumann" ( http://dblp.L3S.de/Authors/Frank_Neumann )

URL (Homepage):  http://www.mpi-inf.mpg.de/~fne/  Author page on DBLP  Author page in RDF  Community of Frank Neumann in ASPL-2

Publication years (Num. hits)
1999-2006 (17) 2007-2008 (26) 2009-2010 (35) 2011 (16) 2012 (4)
Publication types (Num. hits)
article(35) incollection(2) inproceedings(60) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 63 occurrences of 22 keywords

Results
Found 98 publication records. Showing 98 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt Theoretical analysis of two ACO approaches for the traveling salesman problem. Search on Bibsonomy Swarm Intelligence The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Per Kristian Lehre, Frank Neumann, Jonathan E. Rowe, Xin Yao Editorial to the special issue on "Theoretical Foundations of Evolutionary Computation". Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Markus Wagner, Jareth Day, Frank Neumann A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Frank Neumann Computational Complexity Analysis of Multi-Objective Genetic Programming Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Tobias Friedrich, Christian Horoba, Frank Neumann Illustration of fairness in evolutionary multi-objective optimization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt Runtime analysis of the 1-ANT ant colony optimizer. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Anton V. Eremeev, Frank Neumann, Madeleine Theile, Christian Thyssen Evolutionary algorithms and dynamic programming. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Joachim Reichel, Martin Skutella Computing Minimum Cuts by Randomized Search Heuristics. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Wagner, Frank Neumann Computational Complexity Results for Genetic Programming and the Sorting Problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Markus Wagner, Jareth Day, Diora Jordan, Trent Kroeger, Frank Neumann Evolving Pacing Strategies for Team Pursuit Track Cycling Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Katya Vladislavleva, Tobias Friedrich, Frank Neumann, Markus Wagner Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tobias Friedrich, Frank Neumann Foundations of evolutionary multi-objective optimization. Search on Bibsonomy GECCO (Companion) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Pietro Simone Oliveto, Günter Rudolph, Dirk Sudholt On the effectiveness of crossover for migration in parallel evolutionary algorithms. Search on Bibsonomy GECCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Timo Kötzing, Frank Neumann, Reto Spöhel PAC learning and genetic programming. Search on Bibsonomy GECCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Thomas Jansen, Frank Neumann Computational complexity and evolutionary computation. Search on Bibsonomy GECCO (Companion) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner Approximation-Guided Evolutionary Multi-Objective Optimization. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Tobias Friedrich, Trent Kroeger, Frank Neumann Weighted Preferences in Evolutionary Multi-objective Optimization. Search on Bibsonomy Australasian Conference on Artificial Intelligence The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Mainberger, Sebastian Hoffmann, Joachim Weickert, Ching Hoo Tang, Daniel Johannsen, Frank Neumann, Benjamin Doerr Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting. Search on Bibsonomy SSVM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner Simple max-min ant systems and the optimization of linear pseudo-boolean functions. Search on Bibsonomy FOGA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Greg Durrett, Frank Neumann, Una-May O'Reilly Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. Search on Bibsonomy FOGA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Frank Neumann When to use bit-wise neutrality. Search on Bibsonomy Natural Computing The full citation details ... 2010 DBLP  BibTeX  RDF
1Tobias Friedrich, Nils Hebbinghaus, Frank Neumann Plateaus can be harder in multi-objective optimization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Carsten Witt Ant Colony Optimization and the minimum spanning tree problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Frank Neumann, Ingo Wegener Editorial. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Frank Neumann In Memoriam: Ingo Wegener. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Thomas Jansen, Frank Neumann Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization. Search on Bibsonomy Evolutionary Computation The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Search on Bibsonomy Evolutionary Computation The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Greg Durrett, Frank Neumann, Una-May O'Reilly Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Timo Kötzing, Frank Neumann, Dirk Sudholt, Markus Wagner Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Christian Horoba, Frank Neumann Approximating Pareto-Optimal Sets Using Diversity Strategies in Evolutionary Multi-Objective Optimization. Search on Bibsonomy Advances in Multi-Objective Nature Inspired Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation. Search on Bibsonomy PPSN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Süntje Böttcher, Benjamin Doerr, Frank Neumann Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. Search on Bibsonomy PPSN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Madeleine Theile How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem. Search on Bibsonomy PPSN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile More Effective Crossover Operators for the All-Pairs Shortest Path Problem. Search on Bibsonomy PPSN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Thomas Jansen, Frank Neumann Computational complexity and evolutionary computation. Search on Bibsonomy GECCO (Companion) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF runtime analysis
1Tobias Friedrich, Frank Neumann Foundations of evolutionary multi-objective optimization. Search on Bibsonomy GECCO (Companion) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF multiobjective optimization
1Frank Neumann, Dirk Sudholt, Carsten Witt A few ants are enough: ACO with iteration-best update. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF iteration-best update, theory, ant colony optimization, runtime analysis
1Rudolf Berghammer, Tobias Friedrich, Frank Neumann Set-based multi-objective optimization, indicators, and deteriorative cycles. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF performance measures, multiobjective optimization, cycles, hypervolume indicator
1Timo Kötzing, Per Kristian Lehre, Frank Neumann, Pietro Simone Oliveto Ant colony optimization and the minimum cut problem. Search on Bibsonomy GECCO The full citation details ... 2010 DBLP  DOI  BibTeX  RDF ant colony optimization, min-cut
1Timo Kötzing, Frank Neumann, Heiko Röglin, Carsten Witt Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem. Search on Bibsonomy ANTS Conference The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Adam Ghandar, Zbigniew Michalewicz, Frank Neumann Evolving Fuzzy Rules: Evaluation of a New Approach. Search on Bibsonomy SEAL The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Dirk Sudholt, Carsten Witt Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Search on Bibsonomy Swarm Intelligence The full citation details ... 2009 DBLP  DOI  BibTeX  RDF MMAS, Theory, Ant colony optimization, Runtime analysis
1Tobias Friedrich, Nils Hebbinghaus, Frank Neumann Comparison of simple diversity mechanisms on plateau functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Carsten Witt Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Ant colony optimization, Runtime analysis, Randomized search heuristics
1Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem. Search on Bibsonomy Evolutionary Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler On the Effects of Adding Objectives to Plateau Functions. Search on Bibsonomy IEEE Trans. Evolutionary Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Dirk Sudholt, Carsten Witt Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search. Search on Bibsonomy Innovations in Swarm Intelligence The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Jansen, Frank Neumann Computational complexity and evolutionary computation. Search on Bibsonomy GECCO (Companion) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF computational complexity, evolutionary computation
1Tobias Friedrich, Christian Horoba, Frank Neumann Multiplicative approximations and the hypervolume indicator. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF indicator-based algorithms, evolutionary algorithms, approximation, multi-objective optimization, hypervolume indicator
1Benjamin Doerr, Anton V. Eremeev, Christian Horoba, Frank Neumann, Madeleine Theile Evolutionary algorithms and dynamic programming. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF evolutionary algorithms, dynamic programming, combinatorial optimization
1Frank Neumann, Pietro Simone Oliveto, Carsten Witt Theoretical analysis of fitness-proportional selection: landscapes and efficiency. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF genetic algorithms, theory, selection, running time analysis
1Stefan Kratsch, Frank Neumann Fixed-parameter evolutionary algorithms and the vertex cover problem. Search on Bibsonomy GECCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF evolutionary algorithms, combinatorial optimization, multi-objective optimization, runtime analysis
1Pietro Simone Oliveto, Per Kristian Lehre, Frank Neumann Theoretical analysis of rank-based mutation - combining exploration and exploitation. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann Computing single source shortest paths using single-objective fitness. Search on Bibsonomy FOGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christian Horoba, Frank Neumann Additive approximations of pareto-optimal sets by evolutionary multi-objective algorithms. Search on Bibsonomy FOGA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frank Neumann Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. Search on Bibsonomy Computers & OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jens Kroeske, Adam Ghandar, Zbigniew Michalewicz, Frank Neumann Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Joachim Reichel Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Christian Horoba, Frank Neumann Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dimo Brockhoff, Tobias Friedrich, Frank Neumann Analyzing Hypervolume Indicator Based Algorithms. Search on Bibsonomy PPSN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Thomas Jansen, Frank Neumann Computational complexity and evolutionary computation. Search on Bibsonomy GECCO (Companion) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computational complexity, evolutionary computation
1Christian Horoba, Frank Neumann Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multi-objective optimization, running time analysis
1Frank Neumann, Joachim Reichel, Martin Skutella Computing minimum cuts by randomized search heuristics. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimum s-t-cuts, evolutionary algorithms, multi-objective optimization, randomized search heuristics
1Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann Rigorous analyses of fitness-proportional selection for optimizing linear functions. Search on Bibsonomy GECCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF theory, selection, running time analysis
1Frank Neumann, Dirk Sudholt, Carsten Witt Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search. Search on Bibsonomy ANTS Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Florian Diedrich, Frank Neumann Using fast matrix multiplication in bio-inspired computation for complex optimization problems. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Frank Neumann When to use bit-wise neutrality. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Florian Diedrich, Britta Kehden, Frank Neumann Multi-objective Problems in Terms of Relational Algebra. Search on Bibsonomy RelMiCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Frank Neumann, Ingo Wegener Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Nils Hebbinghaus, Frank Neumann Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators. Search on Bibsonomy Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler Do additional objectives make a problem harder? Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multi-objective optimization, running time analysis
1Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt Approximating covering problems by randomized search heuristics using multi-objective models. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF combinatorial optimization, multi-objective optimization, runtime analysis, covering problems
1Thomas Jansen, Frank Neumann Computational complexity and evolutionary computation. Search on Bibsonomy GECCO (Companion) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, evolutionary computation, theory
1Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carsten Witt On the runtime analysis of the 1-ANT ACO algorithm. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF ant colony optimization, runtime analysis
1Tobias Friedrich, Nils Hebbinghaus, Frank Neumann Rigorous analyses of simple diversity mechanisms. Search on Bibsonomy GECCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF selection procedures, diversity, runtime analysis
1Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann A rigorous view on neutrality. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank Neumann, Carsten Witt On improving approximate solutions by evolutionary algorithms. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Tobias Friedrich, Nils Hebbinghaus, Frank Neumann Plateaus can be harder in multi-objective optimization. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Carsten Witt Ant Colony Optimization and the Minimum Spanning Tree Problem. Search on Bibsonomy LION The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Dirk Sudholt, Carsten Witt Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions. Search on Bibsonomy SLS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Frank Neumann Combinatorial optimization and the analysis of randomized search heuristics. Search on Bibsonomy 2006   RDF
1Frank Neumann, Ingo Wegener Minimum spanning trees made easier via multi-objective optimization. Search on Bibsonomy Natural Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF multi-objective optimization, running time analysis, working principles of evolutionary computing
1Frank Neumann, Carsten Witt Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Frank Neumann, Carsten Witt Ant Colony Optimization and the Minimum Spanning Tree Problem. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Nils Hebbinghaus, Benjamin Doerr, Frank Neumann Speeding up Evolutionary Algorithms by Restricted Mutation Operators. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Benjamin Doerr, Nils Hebbinghaus, Frank Neumann Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators. Search on Bibsonomy PPSN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Britta Kehden, Frank Neumann A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems. Search on Bibsonomy EvoCOP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Marco Laumanns Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Carsten Witt Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Search on Bibsonomy Theory of Evolutionary Algorithms The full citation details ... 2006 DBLP  BibTeX  RDF
1Frank Neumann, Carsten Witt Runtime Analysis of a Simple Ant Colony Optimization Algorithm. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Marco Laumanns Speeding Up Approximation Algorithms for NP-hard Spanning Forest Problems by Multi-objective Optimization Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Frank Neumann, Ingo Wegener Minimum spanning trees made easier via multi-objective optimization. Search on Bibsonomy GECCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multi-objective optimization, running time analysis, working principles of evolutionary computing
1Britta Kehden, Frank Neumann, Rudolf Berghammer Relational Implementation of Simple Parallel Evolutionary Algorithms. Search on Bibsonomy RelMiCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Rudolf Berghammer, Frank Neumann RelView - An OBDD-Based Computer Algebra System for Relations. Search on Bibsonomy CASC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Frank Neumann Expected Runtimes of a Simple Evolutionary Algorithm for the Multi-objective Minimum Spanning Tree Problem. Search on Bibsonomy PPSN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Frank Neumann, Ingo Wegener Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. Search on Bibsonomy GECCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Karl Jug, Christian Kölle, Frank Neumann Treatment of reactions in solutions with isodensity surfaces. Search on Bibsonomy Journal of Computational Chemistry The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #98 of 98 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.