600 search results - page 12 / 120 » Solving Distributed Constraint Optimization Problems Using L... |
CHARME
2003
Springer
15 years 4 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
BMCBI
2010
14 years 11 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
100
click to vote
KBSE
2010
IEEE
14 years 9 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
ENTCS
2007
14 years 10 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...