693 search results - page 14 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
167
click to vote
CP
2003
Springer
15 years 11 months 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...
156
click to vote
JDWM
2007
15 years 5 months ago
2007
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
170
click to vote
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
155
click to vote
AAAI
1997
15 years 7 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
152
click to vote
CONSTRAINTS
2006
15 years 5 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...