526 search results - page 26 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
69
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
AAAI
2011
13 years 9 months ago
2011
In this paper we examine the general problem of generating preferred explanations for observed behavior with respect to a model of the behavior of a dynamical system. This problem...
106
Voted
ECP
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...