526 search results - page 15 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
IEAAIE
2010
Springer
14 years 7 months ago
2010
Springer
Swarm Intelligence has been a successful approach to solve some combinatorial problems through the metaphor of interacting evolving individuals of a a population P in a closed toru...
64
Voted
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
123
click to vote
HEURISTICS
2010
14 years 4 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...