559 search results - page 64 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
AIPS
2007
13 years 10 months ago
2007
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
PAMI
2007
13 years 7 months ago
2007
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
CP
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
CP
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
FOCI
2007
IEEE
14 years 2 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...