660 search results - page 6 / 132 » Hybrid CSP Solving |
209
click to vote
AI
2003
Springer
16 years 20 days 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...
187
click to vote
SARA
2007
Springer
16 years 1 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...
147
Voted
BIRTHDAY
2004
Springer
16 years 25 days ago
2004
Springer
191
Voted
ECAI
2006
Springer
15 years 11 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 ...
200
Voted
PUK
2001
15 years 8 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...