18 search results - page 1 / 4 » A Local Search Approach to Solve Incomplete Fuzzy CSPs |
94
Voted
ICAART
2011
INSTICC
14 years 5 months ago
2011
INSTICC
146
Voted
TEC
2002
15 years 1 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
79
Voted
AAAI
2008
15 years 4 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
114
click to vote
SARA
2007
Springer
15 years 8 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...
110
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...