566 search results - page 54 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
SAC
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
100
Voted
MODELS
2010
Springer
14 years 11 months ago
2010
Springer
In feature models’ construction, one basic task is to ensure the consistency of feature models, which often involves detecting and fixing of inconsistencies in feature models. S...
128
Voted
AAAI
2000
15 years 1 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
98
Voted
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...