653 search results - page 7 / 131 » Factored Planning: How, When, and When Not |
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
This paper addresses the problem of plan recognition for multiagent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. T...
XIMEP
2004
ACM
15 years 5 months ago
2004
ACM
We give an overview on how XQuery processing works in our native XML database system Natix. After a brief description of the query compiler we focus on the aspect of join ordering...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
IIE
2007
14 years 11 months ago
2007
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
100
click to vote
AI
2008
Springer
14 years 11 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...