693 search results - page 12 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
127
click to vote
IAT
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
114
click to vote
FLAIRS
2007
15 years 4 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
112
click to vote
CISSE
2008
Springer
15 years 3 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
115
click to vote
HEURISTICS
2007
15 years 1 months ago
2007
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
107
click to vote
NLDB
2005
Springer
15 years 7 months ago
2005
Springer
For most English words, dictionaries give various senses: e.g., “bank” can stand for a financial institution, shore, set, etc. Automatic selection of the sense intended in a gi...