Sciweavers

460 search results - page 36 / 92
» A New Approach to Conformant Planning Using CNF*
Sort
View
ISDA
2009
IEEE
15 years 4 months ago
From Local Patterns to Global Models: Towards Domain Driven Educational Process Mining
Educational process mining (EPM) aims at (i) constructing complete and compact educational process models that are able to reproduce all observed behavior (process model discovery...
Nikola Trcka, Mykola Pechenizkiy
AIPS
2006
14 years 11 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...
AAAI
2008
15 years 1 days ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
3DPVT
2006
IEEE
147views Visualization» more  3DPVT 2006»
15 years 3 months ago
Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning
We recently proposed a new and efficient next-bestview algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evalu...
Kok-Lim Low, Anselmo Lastra
AIPS
2000
14 years 11 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...