Search results for "onemax"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
100	Martin Pelikan, Kumara Sastry	Initial-population bias in the univariate estimation of distribution algorithm.	GECCO	2009	DBLP DOI BibTeX RDF	noisy onemax, onemax, population bias, time to convergence, scalability, estimation of distribution algorithms, population size, edas, univariate marginal distribution algorithm, umda
77	Bulent Buyukbozkirli, Erik D. Goodman	A Statistical Model of GA Dynamics for the OneMax Problem.	GECCO (1)	2004	DBLP DOI BibTeX RDF
60	Stefan Droste	Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax.	GECCO	2003	DBLP DOI BibTeX RDF
60	David Harlan Wood, Junghuei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño	A design for DNA computation of the OneMax problem.	Soft Comput.	2001	DBLP DOI BibTeX RDF
42	Rachel Cavill, Stephen L. Smith 0002, Andy M. Tyrrell	Variable length genetic algorithms with multiple chromosomes on a variant of the Onemax problem.	GECCO	2006	DBLP DOI BibTeX RDF	genetic algorithms, representations, size
42	Tian-Li Yu 0001, David E. Goldberg, Kumara Sastry	Optimal Sampling and Speed-Up for Genetic Algorithms on the Sampled OneMax Problem.	GECCO	2003	DBLP DOI BibTeX RDF
35	Frank Neumann 0001, Dirk Sudholt, Carsten Witt	A few ants are enough: ACO with iteration-best update.	GECCO	2010	DBLP DOI BibTeX RDF	iteration-best update, theory, ant colony optimization, runtime analysis
35	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
35	Chatchawit Aporntewan, Prabhas Chongstitvatana	A quantitative approach for validating the building-block hypothesis.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
35	Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg	Quality-time analysis of multi-objective evolutionary algorithms.	GECCO	2005	DBLP DOI BibTeX RDF	dissimilar schemata, convergence, multi-objective evolutionary algorithms, population sizing
25	Joost Jorritsma, Johannes Lengler, Dirk Sudholt	Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima.	CoRR	2023	DBLP DOI BibTeX RDF
25	Weijie Zheng 0001, Xin Yao 0001	Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights.	CoRR	2023	DBLP DOI BibTeX RDF
25	Jonathan Gadea Harder, Timo Kötzing, Xiaoyue Li, Aishwarya Radhakrishnan	Run Time Bounds for Integer-Valued OneMax Functions.	CoRR	2023	DBLP DOI BibTeX RDF
25	Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou	OneMax Is Not the Easiest Function for Fitness Improvements.	EvoCOP	2023	DBLP DOI BibTeX RDF
25	Joost Jorritsma, Johannes Lengler, Dirk Sudholt	Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima.	GECCO	2023	DBLP DOI BibTeX RDF
25	Marc Kaufmann, Maxime Larcher, Johannes Lengler, Xun Zou	OneMax is not the Easiest Function for Fitness Improvements.	CoRR	2022	DBLP DOI BibTeX RDF
25	Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka	Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax.	Nat. Comput.	2022	DBLP DOI BibTeX RDF
25	Zi-An Zhang, Chao Bian 0002, Chao Qian 0001	Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes.	PPSN (2)	2022	DBLP DOI BibTeX RDF
25	João Victor Ribeiro Ferro, José Rubens da Silva Brito, Roberta Vilhena Vieira Lopes, Evandro de Barros Costa	Mutation Rate Analysis Using a Self-Adaptive Genetic Algorithm on the OneMax Problem.	BRACIS (1)	2022	DBLP DOI BibTeX RDF
25	Nathan Buskulic, Carola Doerr	Maximizing Drift Is Not Optimal for Solving OneMax.	Evol. Comput.	2021	DBLP DOI BibTeX RDF
25	Maxim Buzdalov 0001, Carola Doerr	Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax.	CoRR	2021	DBLP BibTeX RDF
25	Arnaud Berny	Affine OneMax.	CoRR	2021	DBLP BibTeX RDF
25	Maxim Buzdalov 0001, Carola Doerr	Optimal static mutation strength distributions for the (1 + λ) evolutionary algorithm on OneMax.	GECCO	2021	DBLP DOI BibTeX RDF
25	Arnaud Berny	Affine OneMax.	GECCO Companion	2021	DBLP DOI BibTeX RDF
25	Yu-an Zhang, Xiaofeng Qin, Qinglian Ma, Minghao Zhao 0001, Satoru Hiwa, Tomoyuki Hiroyasu, Hiroshi Furutani	Markov chain analysis of evolutionary algorithms on OneMax function - From coupon collector's problem to (1 + 1) EA.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
25	Martin S. Krejca, Carsten Witt	Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
25	Maxim Buzdalov 0001, Carola Doerr	Optimal Mutation Rates for the (1+λ) EA on OneMax.	CoRR	2020	DBLP BibTeX RDF
25	Maxim Buzdalov 0001, Carola Doerr	Optimal Mutation Rates for the (1+λ ) EA on OneMax.	PPSN (2)	2020	DBLP DOI BibTeX RDF
25	Carsten Witt	Upper Bounds on the Running Time of the Univariate Marginal Distribution Algorithm on OneMax.	Algorithmica	2019	DBLP DOI BibTeX RDF
25	Chao Qian 0001, Chao Bian 0002, Wu Jiang, Ke Tang 0001	Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise.	Algorithmica	2019	DBLP DOI BibTeX RDF
25	Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Rolf Wanka	Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax.	CoRR	2019	DBLP BibTeX RDF
25	Nathan Buskulic, Carola Doerr	Maximizing Drift is Not Optimal for Solving OneMax.	CoRR	2019	DBLP BibTeX RDF
25	Luca Mossina, Emmanuel Rachelson, Daniel Delahaye	A Reinforcement Learning Perspective on the Optimal Control of Mutation Probabilities for the (1+1) Evolutionary Algorithm: First Results on the OneMax Problem.	CoRR	2019	DBLP BibTeX RDF
25	Nathan Buskulic, Carola Doerr	Maximizing drift is not optimal for solving OneMax.	GECCO (Companion)	2019	DBLP DOI BibTeX RDF
25	Christian Gießen, Carsten Witt	Optimal Mutation Rates for the (1+λ) EA on OneMax Through Asymptotically Tight Drift Analysis.	Algorithmica	2018	DBLP DOI BibTeX RDF
25	Carola Doerr, Furong Ye, Sander van Rijn, Hao Wang 0025, Thomas Bäck	Towards a Theory-Guided Benchmarking Suite for Discrete Black-Box Optimization Heuristics: Profiling (1+λ) EA Variants on OneMax and LeadingOnes.	CoRR	2018	DBLP BibTeX RDF
25	Chao Bian 0002, Chao Qian 0001, Ke Tang 0001	Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise.	PPSN (2)	2018	DBLP DOI BibTeX RDF
25	Carola Doerr, Furong Ye, Sander van Rijn, Hao Wang 0025, Thomas Bäck	Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1 + λ) EA variants on onemax and leadingones.	GECCO	2018	DBLP DOI BibTeX RDF
25	Carola Doerr, Johannes Lengler	OneMax in Black-Box Models with Several Restrictions.	Algorithmica	2017	DBLP DOI BibTeX RDF
25	Christian Gießen, Carsten Witt	The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax.	Algorithmica	2017	DBLP DOI BibTeX RDF
25	Carsten Witt	Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax.	CoRR	2017	DBLP BibTeX RDF
25	Chao Qian 0001, Chao Bian 0002, Wu Jiang, Ke Tang 0001	Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise.	CoRR	2017	DBLP BibTeX RDF
25	Chao Qian 0001, Chao Bian 0002, Wu Jiang, Ke Tang 0001	Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise.	GECCO	2017	DBLP DOI BibTeX RDF
25	Carsten Witt	Upper bounds on the runtime of the univariate marginal distribution algorithm on onemax.	GECCO	2017	DBLP DOI BibTeX RDF
25	Martin S. Krejca, Carsten Witt	Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax.	FOGA	2017	DBLP DOI BibTeX RDF
25	Moritz Mühlenthaler, Alexander Raß, Manuel Schmitt, Andreas Siegling, Rolf Wanka	Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax.	FOGA	2017	DBLP DOI BibTeX RDF
25	Jialin Liu 0001, Michael Fairbank, Diego Perez Liebana, Simon M. Lucas	Optimal resampling for the noisy OneMax problem.	CoRR	2016	DBLP BibTeX RDF
25	Christian Gießen, Carsten Witt	Optimal Mutation Rates for the (1+λ) EA on OneMax.	GECCO	2016	DBLP DOI BibTeX RDF
25	Arina Buzdalova, Irina Petrova 0001, Maxim Buzdalov 0001	Runtime analysis of different Approaches to select conflicting auxiliary objectives in the generalized OneMax problem.	SSCI	2016	DBLP DOI BibTeX RDF
25	Benjamin Doerr, Carola Doerr	A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax.	CoRR	2015	DBLP BibTeX RDF
25	Carola Doerr, Johannes Lengler	OneMax in Black-Box Models with Several Restrictions.	CoRR	2015	DBLP BibTeX RDF
25	Yifei Du, Qinlian Ma, Kenji Aoki 0003, Makoto Sakamoto, Hiroshi Furutani, Yu-an Zhang	Hitting Time Analysis of OneMax Problem in Genetic Algorithm.	J. Robotics Netw. Artif. Life	2015	DBLP DOI BibTeX RDF
25	Maxim Buzdalov 0001, Arina Buzdalova	Can OneMax help optimizing LeadingOnes using the EA+RL method?	CEC	2015	DBLP DOI BibTeX RDF
25	Denis Antipov, Maxim Buzdalov 0001, Benjamin Doerr	Runtime Analysis of (1+1) Evolutionary Algorithm Controlled with Q-learning Using Greedy Exploration Strategy on OneMax+ZeroMax Problem.	EvoCOP	2015	DBLP DOI BibTeX RDF
25	Benjamin Doerr, Carola Doerr	A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax.	GECCO	2015	DBLP DOI BibTeX RDF
25	Carola Doerr, Johannes Lengler	OneMax in Black-Box Models with Several Restrictions.	GECCO	2015	DBLP DOI BibTeX RDF
25	Christian Gießen, Carsten Witt	Population Size vs. Mutation Strength for the (1+λ) EA on OneMax.	GECCO	2015	DBLP DOI BibTeX RDF
25	Timo Kötzing, Andrei Lissovoi, Carsten Witt	(1+1) EA on Generalized Dynamic OneMax.	FOGA	2015	DBLP DOI BibTeX RDF
25	Yifei Du, Qinlian Ma, Makoto Sakamoto, Hiroshi Furutani, Yu-an Zhang	Runtime Analysis of OneMax Problem in Genetic Algorithm.	J. Robotics Netw. Artif. Life	2014	DBLP DOI BibTeX RDF
25	Maxim Buzdalov 0001, Arina Buzdalova	Onemax helps optimizing XdivK: : theoretical runtime analysis for RLS and EA+RL.	GECCO (Companion)	2014	DBLP DOI BibTeX RDF
25	Qinglian Ma, Yu-an Zhang, Kiminobu Koga, Kunihito Yamamori, Makoto Sakamoto, Hiroshi Furutani	Stochastic analysis of OneMax problem using Markov chain.	Artif. Life Robotics	2013	DBLP DOI BibTeX RDF
25	Benjamin Doerr, Carola Winzen	Memory-restricted black-box complexity of OneMax.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
25	Aram Ter-Sarkisov, Stephen R. Marsland	Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions	CoRR	2011	DBLP BibTeX RDF
25	Aram Ter-Sarkisov, Stephen Marsland	Convergence Properties of Two (μ+λ) Evolutionary Algorithms on OneMax and Royal Roads Test Functions.	IJCCI (ECTA-FCTA)	2011	DBLP BibTeX RDF
25	Christian José Correa Villalón, Felipe Padilla Diaz, Eugenio Pérez Molphe, Eunice Ponce de León, Fátima Sayuri Quezada Aguilera, Julio César Ponce Gallegos	New Algorithm Transgenic with Homology to solve the problem of OneMax.	Computación y Sistemas	2010	DBLP BibTeX RDF
25	Worasait Suwannik, Prabhas Chongstitvatana	Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding.	IEEE Congress on Evolutionary Computation	2008	DBLP DOI BibTeX RDF
25	Stefan Droste	Analysis of the (1+1) EA for a Noisy OneMax.	GECCO (1)	2004	DBLP DOI BibTeX RDF
25	Stefan Droste	Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant.	IEEE Congress on Evolutionary Computation	2002	DBLP DOI BibTeX RDF
25	Tina Yu, Julian F. Miller	The Role of Neutral and Adaptive Mutation in an Evolutionary Search on the OneMax Problem.	GECCO Late Breaking Papers	2002	DBLP BibTeX RDF
25	Hiroshi Furutani	Schema Analysis of OneMax Problem: Evolution Equation for First Order Schemata.	FOGA	2002	DBLP BibTeX RDF
25	David Harlan Wood, Junghuei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño	In vitro selection for a OneMax DNA evolutionary computation.	DNA Based Computers	1999	DBLP DOI BibTeX RDF
17	Benjamin Doerr, Mahmoud Fouz, Carsten Witt	Quasirandom evolutionary algorithms.	GECCO	2010	DBLP DOI BibTeX RDF	quasirandomness, evolutionary algorithms
17	Elizabeth Radetic, Martin Pelikan	Spurious dependencies and EDA scalability.	GECCO	2010	DBLP DOI BibTeX RDF	gambler's ruin model, initial supply, spurious dependencies, scalability, decision making, estimation of distribution algorithms, population sizing, model accuracy
17	Álvaro Fialho, Marc Schoenauer, Michèle Sebag	Toward comparison-based adaptive operator selection.	GECCO	2010	DBLP DOI BibTeX RDF	ROC area under curve, adaptive operator selection, parameter control, multi-armed bandits
17	Lars Kaden, Nicole Weicker, Karsten Weicker	Metropolis and Symmetric Functions: A Swan Song.	EvoCOP	2009	DBLP DOI BibTeX RDF
17	Álvaro Fialho, Luís Da Costa, Marc Schoenauer, Michèle Sebag	Extreme: dynamic multi-armed bandits for adaptive operator selection.	GECCO (Companion)	2009	DBLP DOI BibTeX RDF	adaptive operator selection, genetic algorithms, parameter control
17	Frank Neumann 0001, Pietro S. 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
17	Seung-Kyu Lee, Byung Ro Moon	Genetic algorithm with adaptive elitism-based immigrants for dynamic optimization problems.	GECCO	2009	DBLP DOI BibTeX RDF	adaptive elitism-based immigrants, elitism-based immigrants, genetic algorithms, dynamic optimization problems
17	R. Paul Wiegand, Gautham Anil, Ivan I. Garibay, Ozlem O. Garibay, Annie S. Wu	On the performance effects of unbiased module encapsulation.	GECCO	2009	DBLP DOI BibTeX RDF	module encapsulation, search space bias, runtime analysis
17	Andrea Valsecchi, Leonardo Vanneschi	A Study of Some Implications of the No Free Lunch Theorem.	EvoWorkshops	2008	DBLP DOI BibTeX RDF
17	Dirk Sudholt, Carsten Witt	Runtime analysis of binary PSO.	GECCO	2008	DBLP DOI BibTeX RDF	particle swarm optimization, runtime analysis
17	Yossi Borenstein	An information perspective on evolutionary computation.	GECCO (Companion)	2008	DBLP DOI BibTeX RDF	information theory, kolmogorov complexity, randomized search heuristics
17	Nachol Chaiyaratana, Theera Piroonratana, Nuntapon Sangkawelert	Effects of diversity control in single-objective and multi-objective genetic algorithms.	J. Heuristics	2007	DBLP DOI BibTeX RDF	Diversity control, Single-objective genetic algorithm, Benchmarking, Multi-objective genetic algorithm
17	Frank Neumann 0001, Dirk Sudholt, Carsten Witt	Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions.	SLS	2007	DBLP DOI BibTeX RDF
17	Benjamin Doerr, Daniel Johannsen	Refined runtime analysis of a basic ant colony optimization algorithm.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
17	Riccardo Poli, Leonardo Vanneschi	Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms.	GECCO	2007	DBLP DOI BibTeX RDF	negative slope coefficient, theory, problem difficulty
17	Yossi Borenstein	An information perspective on evolutionary computation.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	evolutionary computation, theory, Kolmogorov complexity
17	Benjamin Doerr, Frank Neumann 0001, Dirk Sudholt, Carsten Witt	On the runtime analysis of the 1-ANT ACO algorithm.	GECCO	2007	DBLP DOI BibTeX RDF	ant colony optimization, runtime analysis
17	Tuan Hao Hoang, Nguyen Xuan Hoai, Nguyen Thi Hien, Robert I. McKay, Daryl Essam	ORDERTREE: a new test problem for genetic programming.	GECCO	2006	DBLP DOI BibTeX RDF	benchmark problems, genetic programming, problem difficulty
17	Chuan-Kang Ting	On the convergence of multi-parent genetic algorithms.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
17	Johan Parent, Ann Nowé, Kris Steenhaut, Anne Defaweux	Linear genetic programming using a compressed genotype representation.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
17	Jürgen Branke, Christian Schmidt 0002	Sequential Sampling in Noisy Environments.	PPSN	2004	DBLP DOI BibTeX RDF
17	Cheah C. J. Moey, Jonathan E. Rowe	A Reduced Markov Model of GAs Without the Exact Transition Matrix.	PPSN	2004	DBLP DOI BibTeX RDF
17	Rolf Drechsler, Nicole Drechsler	GAME-HDL: Implementation of Evolutionary Algorithms Using Hardware Description Languages.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
17	Andrés Aguilar Contreras, Jonathan E. Rowe, Christopher R. Stephens	Coarse-Graining in Genetic Algorithms: Some Issues and Examples.	GECCO	2003	DBLP DOI BibTeX RDF
17	Conor Ryan, Miguel Nicolau, Michael O'Neill 0001	Genetic Algorithms Using Grammatical Evolution.	EuroGP	2002	DBLP DOI BibTeX RDF
17	Arnaud Berny	Extending Selection Learning toward Fixed-Length d-Ary Strings.	Artificial Evolution	2001	DBLP DOI BibTeX RDF
17	Ingo la Tendresse, Jens Gottlieb, Odej Kao	The Effects of Partial Restarts in Evolutionary Search.	Artificial Evolution	2001	DBLP DOI BibTeX RDF