Sciweavers

1051 search results - page 21 / 211
» Foundations of Constraint Satisfaction
Sort
View
RSA
2006
104views more  RSA 2006»
14 years 9 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
IVC
2002
92views more  IVC 2002»
14 years 9 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...
IJCAI
2003
14 years 11 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov
ECAI
2000
Springer
15 years 1 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 9 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen