7092 search results - page 1041 / 1419 » Parallelizing constraint programs |
168
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. Many symmetry breaking techniques assume that the symmetries of a CSP are given as input in addition to the CSP itself. We present a method that can be used to detect all...
156
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
179
click to vote
CP
2005
Springer
16 years 9 days ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
182
click to vote
ICTCS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
175
click to vote
SAT
2005
Springer
16 years 8 days ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...