Sciweavers

1800 search results - page 349 / 360
» Learning Restart Strategies
Sort
View
CGO
2005
IEEE
14 years 1 months ago
Optimizing Sorting with Genetic Algorithms
The growing complexity of modern processors has made the generation of highly efficient code increasingly difficult. Manual code generation is very time consuming, but it is oft...
Xiaoming Li, María Jesús Garzar&aacu...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
CP
2005
Springer
14 years 1 months ago
2-Way vs. d-Way Branching for CSP
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
Joey Hwang, David G. Mitchell
DAMAS
2005
Springer
14 years 1 months ago
Cognitive Agents for Sense and Respond Logistics
We present a novel cognitive agent architecture and demonstrate its effectiveness in the Sense and Respond Logistics (SRL) domain. Effective applications to support SRL must antic...
Kshanti A. Greene, David G. Cooper, Anna L. Buczak...
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
14 years 1 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici