216 search results - page 8 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
129
click to vote
STACS
2001
Springer
15 years 7 months 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...
189
click to vote
SOICT
2010
14 years 10 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...
124
click to vote
STOC
2003
ACM
16 years 3 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...
171
Voted
LICS
2000
IEEE
15 years 7 months 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...
197
click to vote
IWCLS
2007
Springer
15 years 9 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...