711 search results - page 117 / 143 » Amalgams of Constraint Satisfaction Problems |
IAT
2007
IEEE
15 years 6 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
ICTAI
2007
IEEE
15 years 6 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...
IEEEARES
2007
IEEE
15 years 6 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...
CPC
2006
14 years 11 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
103
click to vote
CP
2008
Springer
15 years 1 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...