Sciweavers

810 search results - page 81 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AIPS
2000
13 years 9 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
AAAI
1994
13 years 9 months ago
Structured Circuit Semantics for Reactive Plan Execution Systems
A variety of reactive plan execution systems have been developed in recent years, each attempting to solve the problem of taking reasonable courses of action fast enough in a dyna...
Jaeho Lee, Edmund H. Durfee
IJCAI
2003
13 years 9 months ago
A Planning Algorithm for Predictive State Representations
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
Masoumeh T. Izadi, Doina Precup
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
14 years 8 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
SBRN
2008
IEEE
14 years 2 months ago
Using a Probabilistic Neural Network for a Large Multi-label Problem
The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the...
Elias Oliveira, Patrick Marques Ciarelli, Alberto ...