90 search results - page 15 / 18 » Failure Analysis in Backtrack Search for Constraint Satisfac... |
CP
2005
Springer
15 years 2 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
CISSE
2008
Springer
14 years 11 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 ...
108
click to vote
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
DSS
2007
14 years 9 months ago
2007
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...