Sciweavers

202 search results - page 11 / 41
» Admissible Heuristics for Optimal Planning
Sort
View
DEXA
1995
Springer
126views Database» more  DEXA 1995»
14 years 7 days ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
ICTAI
1994
IEEE
14 years 24 days ago
Iterative Strengthening: An Algorithm for Generating Anytime Optimal Plans
In order to perform adequately in real-world situations, a planning system must be able to nd the \best" solution while still supporting anytime behavior. We have developed ...
Randall J. Calistri-Yeh
AIPS
2008
13 years 11 months ago
Useless Actions Are Useful
Planning as heuristic search is a powerful approach to solving domain independent planning problems. In recent years, various successful heuristics and planners like FF, LPG, FAST...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
ICDE
2000
IEEE
113views Database» more  ICDE 2000»
14 years 1 months ago
Web Query Optimizer
We consider an architecture of mediators and wrappers for Internet accessible WebSources of limited query capability. Each call to a source is a WebSource Implementation (WSI) and...
Vladimir Zadorozhny, Laura Bright, Louiqa Raschid,...
TSMC
1998
82views more  TSMC 1998»
13 years 8 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin