Sciweavers

95 search results - page 4 / 19
» Computational Aspects of Reordering Plans
Sort
View
AIPS
2011
12 years 9 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
GI
2009
Springer
13 years 3 months ago
Project Planning Support by Model Checking
Abstract: Today's trend in software and system engineering is to utilize more specialized models. This model-based development approach makes a single engineering task more ea...
Björn Axenath, Oliver Sudmann
ICRA
2008
IEEE
157views Robotics» more  ICRA 2008»
14 years 6 days ago
Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
SAC
2009
ACM
14 years 17 days ago
Dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...
Romain Rouvoy, Frank Eliassen, Mikaël Beauvoi...
IPPS
2000
IEEE
13 years 10 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen