314 search results - page 36 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
ISPD
1997
ACM
13 years 12 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
EC
2008
13 years 7 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
FLAIRS
2003
13 years 9 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
CONSTRAINTS
2006
13 years 7 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...