133 search results - page 3 / 27 » A Graph Based Backtracking Algorithm for Solving General CSP... |
CEC
2009
IEEE
13 years 11 months ago
2009
IEEE
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
CPC
2006
13 years 7 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
AAAI
1994
13 years 9 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...