Sciweavers

5 search results - page 1 / 1
» Lemma Reusing for SAT based Planning and Scheduling
Sort
View
AIPS
2006
13 years 5 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
CPAIOR
2006
Springer
13 years 7 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
AAAI
1998
13 years 5 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
AIPS
2009
13 years 4 months ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 6 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives