Sciweavers

45 search results - page 5 / 9
» aips 2009
Sort
View
AIPS
2009
13 years 11 months ago
Exploiting N-Gram Analysis to Predict Operator Sequences
N-gram analysis provides a means of probabilistically predicting the next item in a sequence. Due originally to Shannon, it has proven an effective technique for word prediction i...
Christian J. Muise, Sheila A. McIlraith, Jorge A. ...
AIPS
2009
13 years 11 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
AIPS
2009
13 years 11 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
AIPS
2009
13 years 11 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
AIPS
2009
13 years 11 months ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert