216 search results - page 8 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
STACS
2001
Springer
14 years 3 days ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
SOICT
2010
13 years 2 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
LICS
2000
IEEE
14 years 1 days ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
IWCLS
2007
Springer
14 years 1 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...