Sciweavers

920 search results - page 85 / 184
» Generating Satisfiable Problem Instances
Sort
View
142
Voted
EVOW
2009
Springer
15 years 7 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
IJIT
2004
15 years 3 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
COR
2007
176views more  COR 2007»
15 years 2 months ago
Scheduling and routing of automated guided vehicles: A hybrid approach
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
Ayoub Insa Corréa, André Langevin, L...
CAV
2010
Springer
190views Hardware» more  CAV 2010»
15 years 5 months ago
Measuring and Synthesizing Systems in Probabilistic Environments
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...
Krishnendu Chatterjee, Thomas A. Henzinger, Barbar...
EUROGP
2000
Springer
115views Optimization» more  EUROGP 2000»
15 years 6 months ago
Evolution of a Controller with a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it provides a solution to an entire category of problems. For example, the fa...
John R. Koza, Jessen Yu, Martin A. Keane, William ...