Sciweavers

1614 search results - page 140 / 323
» Planning as Temporal Reasoning
Sort
View
AIPS
2004
15 years 8 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
AIPS
2000
15 years 7 months ago
Probabilistic Hybrid Action Models for Predicting Concurrent Percept-Driven Robot Behavior
This paper develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern concurrent percept-driven robot plans. PHA...
Michael Beetz, Henrik Grosskreutz
AIPS
2009
15 years 7 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 7 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
AEI
2004
87views more  AEI 2004»
15 years 6 months ago
Estimating the productivity of cyclic construction operations using case-based reasoning
The estimation of productivity rates in cyclic construction processes is a difficult, but essential task in the planning of construction projects. The conventional method--a calcu...
Darren Graham, Simon D. Smith