93 search results - page 1 / 19 » Computational complexity analysis of simple genetic programm... |
FOGA
2011
12 years 8 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
PLDI
2004
ACM
13 years 10 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
GPEM
2008
13 years 4 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
GECCO
2008
Springer
2008
Springer
Bond-graphs + genetic programming: analysis of an automatically synthesized rotary mechanical system
13 years 5 months ago
Initial results of an experiment devised to combine Bond-Graph modeling and simulation with genetic programming for automated design of a simple mechatronic system are reported in...