381 search results - page 11 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
UAI
2000
13 years 9 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
ICCS
2003
Springer
14 years 26 days ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
WADS
2001
Springer
14 years 2 days ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
CEC
2003
IEEE
13 years 11 months ago
2003
IEEE
Most embedded systemshave tightconstraints on power consumption because the amonnt of power available to these systems is limited due to the limitation ofbattery life. For this rea...