Search results for "running time analysis"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Yuren Zhou, Zhi Guo, Jun He	On the Running Time Analysis of the (1+1) Evolutionary Algorithm for the Subset Sum Problem.	LSMS	2007	DBLP DOI BibTeX RDF
2	Marco Laumanns, Lothar Thiele, Eckart Zitzler	Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem.	Natural Computing	2004	DBLP DOI BibTeX RDF	decision space partition, evolutionary algorithms, multiobjective optimization, knapsack problem, graph search, running time analysis, Pareto set
2	Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb	Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem.	PPSN	2002	DBLP DOI BibTeX RDF
1	Dirk Sudholt, Christian Thyssen	Running time analysis of Ant Colony Optimization for shortest path problems.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Daniel Johannsen, Carola Winzen	Multiplicative drift analysis.	GECCO	2010	DBLP DOI BibTeX RDF	theory, running time analysis
1	Christian Horoba, Dirk Sudholt	Ant colony optimization for stochastic shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	combinatorial optimization, ant colony optimization, stochastic optimization, shortest path problems, running time analysis
1	Daniel Johannsen, Piyush P. Kurur, Johannes Lengler	Can quantum search accelerate evolutionary algorithms?	GECCO	2010	DBLP DOI BibTeX RDF	theory, quantum algorithm, running time analysis
1	Christian Horoba, Dirk Sudholt	Running Time Analysis of ACO Systems for Shortest Path Problems.	SLS	2009	DBLP DOI BibTeX RDF
1	Frank Neumann, Pietro Simone Oliveto, Carsten Witt	Theoretical analysis of fitness-proportional selection: landscapes and efficiency.	GECCO	2009	DBLP DOI BibTeX RDF	genetic algorithms, theory, selection, running time analysis
1	Nattapat Attiratanasunthron, Jittat Fakcharoenphol	A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs.	Inf. Process. Lett.	2008	DBLP DOI BibTeX RDF
1	Edda Happ, Daniel Johannsen, Christian Klein, Frank Neumann	Rigorous analyses of fitness-proportional selection for optimizing linear functions.	GECCO	2008	DBLP DOI BibTeX RDF	theory, selection, running time analysis
1	Christian Horoba, Frank Neumann	Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization.	GECCO	2008	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis
1	Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus, Christian Klein, Frank Neumann, Eckart Zitzler	Do additional objectives make a problem harder?	GECCO	2007	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis
1	Steffen Christensen, Franz Oppacher	Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations.	GECCO	2007	DBLP DOI BibTeX RDF	genetic programming, representations, running time analysis, speedup technique
1	Brian C. Dean	A simple expected running time analysis for randomized "divide and conquer" algorithms.	Discrete Applied Mathematics	2006	DBLP DOI BibTeX RDF
1	Dirk Sudholt	On the analysis of the (1+1) memetic algorithm.	GECCO	2006	DBLP DOI BibTeX RDF	local search, theory, hybridization, running time analysis
1	Frank Neumann, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	Natural Computing	2006	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
1	Joël Rivat, András Sárközy	On Pseudorandom Sequences and Their Application.	GTIT-C	2006	DBLP DOI BibTeX RDF
1	Rajeev Kumar, Nilanjan Banerjee	Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems.	FOGA	2005	DBLP DOI BibTeX RDF
1	Frank Neumann, Ingo Wegener	Minimum spanning trees made easier via multi-objective optimization.	GECCO	2005	DBLP DOI BibTeX RDF	multi-objective optimization, running time analysis, working principles of evolutionary computing
1	Gang Wu, Jia-Huai You, Guohui Lin	A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem.	WABI	2005	DBLP DOI BibTeX RDF
1	Marco Laumanns, Lothar Thiele, Eckart Zitzler	Running time analysis of multiobjective evolutionary algorithms on pseudo-Boolean functions.	IEEE Trans. Evolutionary Computation	2004	DBLP DOI BibTeX RDF
1	Susumu Suzuki, Toshihide Ibaraki	An average running time analysis of a backtracking algorithm to calculate the measure of the union of hyperrectangles in $d$ dimensions.	CCCG	2004	DBLP BibTeX RDF
1	Nilanjan Banerjee, Rajeev Kumar	Expected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions.	ICONIP	2004	DBLP DOI BibTeX RDF
1	Meinard Müller, Michael Clausen	DFT-based Word Normalization in Finite Supersolvable Groups.	Appl. Algebra Eng. Commun. Comput.	2004	DBLP DOI BibTeX RDF	Word normalization, Power-commutator presentation, Supersolvable groups, Discrete Fourier transform
1	Susumu Suzuki, Toshihide Ibaraki	Average running time analysis of an algorithm to calculate the size of the union of Cartesian products.	Discrete Mathematics	2003	DBLP DOI BibTeX RDF
1	Fabian Wolf, Jan Staschulat, Rolf Ernst	Associative caches in formal software timing analysis.	DAC	2002	DBLP DOI BibTeX RDF	real-time, timing analysis, embedded software, cache analysis
1	Susumu Suzuki, Toshihide Ibaraki	Average Running Time Analysis of an Algorithm to Calculate the Size of the Union of Cartesian Products.	Electronic Notes in Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	András A. Benczúr, Jörg Förster, Zoltán Király	Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis.	ESA	1999	DBLP DOI BibTeX RDF