2899 search results - page 408 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
141
Voted
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
131
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
158
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
134
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
170
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...