2981 search results - page 153 / 597 » Answer Set Planning |
148
Voted
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
Most research about multi-agent coordination is concentrated at a high level, e.g., developing coordination interaction protocols to be imposed on agents. There has been less conc...
115
Voted
AAAI
1998
15 years 5 months ago
1998
Wedescribe somenewpreprocessing techniques that enable faster domain-independentplanning. Thefirst set of techniquesis aimedat inferring state constraints from the structure of pl...
103
Voted
ATMOS
2009
15 years 4 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
192
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
166
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...