317 search results - page 14 / 64 » Improving Planning Performance Using Low-Conflict Relaxed Pl... |
AAAI
2006
15 years 6 days ago
2006
Planning in partially-observable dynamical systems is a challenging problem, and recent developments in point-based techniques such as Perseus significantly improve performance as...
ICDE
2010
IEEE
15 years 5 months ago
2010
IEEE
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
AIPS
2004
15 years 6 days ago
2004
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
CIKM
2006
Springer
15 years 2 months ago
2006
Springer
The I/O performance of query processing can be improved using two complementary approaches. One can try to improve on the buffer and the file system management policies of the DB ...
101
click to vote
ICC
2007
IEEE
15 years 5 months ago
2007
IEEE
—We present a multi-constrained routing algorithm, called Delay-constrained Pool Sharing (DPS), in a survivable mesh network. The goal of this algorithm is to find a pair of link...