1051 search results - page 144 / 211 » Foundations of Constraint Satisfaction |
169
click to vote
IEEEARES
2007
IEEE
16 years 19 days 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...
132
click to vote
IROS
2007
IEEE
16 years 18 days 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...
191
click to vote
CP
2007
Springer
16 years 15 days 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...
177
click to vote
ISAAC
2007
Springer
16 years 14 days 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...
166
click to vote
SAT
2007
Springer
16 years 13 days ago
2007
Springer
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...