Sciweavers

79 search results - page 5 / 16
» Improved algorithms for 3-coloring, 3-edge-coloring, and con...
Sort
View
FLAIRS
2003
13 years 9 months ago
A Graph Based Synthesis Algorithm for Solving CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
Wanlin Pang, Scott D. Goodwin
CP
2005
Springer
14 years 1 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
IVC
2002
92views more  IVC 2002»
13 years 7 months ago
Image segmentation by relaxation using constraint satisfaction neural network
The problem of image segmentation using constraint satisfaction neural networks (CSNN) has been considered. Several variations of the CSNN theme have been advanced to improve its ...
Fatih Kurugollu, Bülent Sankur, A. Emre Harma...
FLAIRS
2007
13 years 10 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
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...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...