Sciweavers

101 search results - page 12 / 21
» Reviving Partial Order Planning
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 9 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ATAL
2009
Springer
14 years 1 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
CP
2005
Springer
14 years 5 days ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
JAIR
2010
131views more  JAIR 2010»
13 years 5 months ago
Narrative Planning: Balancing Plot and Character
Narrative, and in particular storytelling, is an important part of the human experience. Consequently, computational systems that can reason about narrative can be more effective...
Mark O. Riedl, R. Michael Young
AAAI
2004
13 years 8 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner