Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population (bibtex)
@inproceedings{DLHP2005b,
	_day = {04},
	_month = {08},
	abstract = {This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology. Partially defined solutions interact and evolve into aggregations until a full solution for the problem at hand is found. The impact of the initial population on the outcome and the dynamics of the process is evaluated using the domain of binary constraint satisfaction problems.},
	author = {A. Defaweux and T. Lenaerts and van Hemert, J.I. and J. Parent},
	booktitle = {Proceedings of the Congress on Evolutionary Computation},
	date-added = {2008-08-18 12:44:11 +0100},
	date-modified = {2008-08-18 12:44:11 +0100},
	keywords = {constraint satisfaction; evolutionary computation},
	pages = {196--203},
	pdf = {http://www.vanhemert.co.uk/publications/cec2005-Complexity_Transitions_in_Evolutionary_Algorithms_Evaluating_the_impact_of_the_initial_population.pdf},
	publisher = {{IEEE} Press},
	title = {Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population},
	year = {2005}}
Powered by bibtexbrowser