400 search results - page 56 / 80 » Backtracking |
154
click to vote
SETN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
141
Voted
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
160
click to vote
SC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
155
click to vote
SC
2003
ACM
15 years 11 months ago
2003
ACM
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
175
click to vote
AUSAI
2003
Springer
15 years 11 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...