1453 search results - page 177 / 291 » Partial Constraint Satisfaction |
124
click to vote
ICTAI
2007
IEEE
15 years 11 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
145
Voted
IEEEARES
2007
IEEE
15 years 11 months ago
2007
IEEE
The most important part of a firewall configuration process is the implementation of a security policy by a security administrator. However, this security policy is not designed b...
116
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
166
click to vote
CP
2007
Springer
15 years 10 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...
153
Voted
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...