Sciweavers

10622 search results - page 1804 / 2125
» Python Programming Language
Sort
View
156
Voted
CP
2005
Springer
16 years 6 days ago
Tree Decomposition with Function Filtering
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...
Martí Sánchez, Javier Larrosa, Pedro...
CP
2005
Springer
16 years 6 days ago
On Solving Soft Temporal Constraints Using SAT Techniques
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
Hossein M. Sheini, Bart Peintner, Karem A. Sakalla...
CP
2005
Springer
16 years 6 days ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Carsten Sinz
CP
2005
Springer
16 years 6 days ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
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...
Roie Zivan, Amnon Meisels
CSL
2005
Springer
16 years 6 days ago
Distributed Control Flow with Classical Modal Logic
In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities P and Q we were able to capture t...
Tom Murphy VII, Karl Crary, Robert Harper
« Prev « First page 1804 / 2125 Last » Next »