Sciweavers

AIPS
1998
14 years 24 days ago
Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems
Westudytheruntimeprofilesofcompletebacktrackstylesearchmethodsappliedtohardschedulingproblems.Suchsearchmethodsoftenexhibita largevariabilityinperformanceduetothenon-standardnatur...
Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tr...
AIPS
1998
14 years 24 days ago
A Complete Bidirectional Planner
The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed backward chaining with simulation of plan execution. Experiments have demonstrated t...
Eugene Fink, Jim Blythe
AIPS
1998
14 years 24 days ago
How to Solve It Automatically: Selection Among Problem Solving Methods
The choice of an appropriate problem-solving method, from available methods, is a crucial skill for experts in many areas. We describe a technique for the automatic selection amon...
Eugene Fink
AIPS
1998
14 years 24 days ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
AIPS
1998
14 years 24 days ago
Making Forward Chaining Relevant
Planning by forward chaining through the world space has long been dismissed as being "obviously" infeasible. Nevertheless, this approach to planning has many advantages...
Fahiem Bacchus, Yee Whye Teh
AIPS
1998
14 years 24 days ago
Flexible and Scalable Query Planning in Distributed and Heterogeneous Environments
We present the application of the Planning by Rewriting PbR framework to query planning in distributed and heterogeneous environments. PbR is a new paradigm for e cient high-quali...
José Luis Ambite, Craig A. Knoblock
AIPS
1998
14 years 24 days ago
Strong Planning in Non-Deterministic Domains Via Model Checking
Alessandro Cimatti, Marco Roveri, Paolo Traverso