Sciweavers

1146 search results - page 72 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 8 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 2 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner
AIPS
2007
13 years 10 months ago
Context-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts ar...
Adriaan ter Mors, Jonne Zutt, Cees Witteveen
SARA
2009
Springer
14 years 2 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
KR
1992
Springer
13 years 12 months ago
Abductive Plan Recognition and Diagnosis: A Comprehensive Empirical Evaluation
While it has been realized for quite some time within AI that abduction is a general model of explanation for a variety of tasks, there have been no empirical investigations into ...
Hwee Tou Ng, Raymond J. Mooney