Sciweavers

408 search results - page 21 / 82
» A lookahead strategy for solving large planning problems
Sort
View
AAAI
1996
14 years 11 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
HM
2009
Springer
145views Optimization» more  HM 2009»
15 years 2 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ICRA
2002
IEEE
94views Robotics» more  ICRA 2002»
15 years 2 months ago
Sensor Planning and Control in a Dynamic Environment
This paper presents an approach to the problem of controlling the configuration of a team of mobile agents equipped with cameras so as to optimize the quality of the estimates de...
John R. Spletzer, Camillo J. Taylor
SC
2003
ACM
15 years 2 months ago
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
Kai Wang, Jun Zhang, Chi Shen
CI
2011
110views more  CI 2011»
14 years 4 months ago
Experiences with planning for natural language generation
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
Alexander Koller, Ronald P. A. Petrick