713 search results - page 114 / 143 » Saving Space by Algebraization |
WIS
2004
14 years 11 months ago
2004
Modern databases allow mobile clients that subscribe to replicated data, to process the replica without requiring continuous connectivity, and to receive the updates while connecte...
UAI
2003
14 years 11 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
WIESS
2000
14 years 11 months ago
2000
The linker is often a time bottleneck in the development of large applications. Traditional linkers process all input files, even if only one or two objects have changed since the...
AIPS
1996
14 years 11 months ago
1996
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
AIPS
2009
14 years 11 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...