660 search results - page 6 / 132 » Hybrid CSP Solving |
101
Voted
AI
2003
Springer
15 years 4 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
100
Voted
SARA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
BIRTHDAY
2004
Springer
15 years 5 months ago
2004
Springer
90
Voted
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
PUK
2001
15 years 1 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...