365 search results - page 49 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
132
Voted
CVPR
2001
IEEE
16 years 2 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
128
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
107
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
105
click to vote
ANOR
2004
15 years 10 days ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
154
click to vote
CPAIOR
2010
Springer
14 years 10 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...