Sciweavers

714 search results - page 76 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CP
2008
Springer
13 years 11 months ago
A Branch and Bound Algorithm for Numerical MAX-CSP
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
Jean-Marie Normand, Alexandre Goldsztejn, Marc Chr...
CSCLP
2006
Springer
14 years 1 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
CP
2006
Springer
14 years 1 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
Guillaume Verger, Christian Bessière
SARA
2007
Springer
14 years 4 months ago
Generating Implied Boolean Constraints Via Singleton Consistency
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
Roman Barták
SSD
2007
Springer
116views Database» more  SSD 2007»
14 years 4 months ago
Continuous Constraint Query Evaluation for Spatiotemporal Streams
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
Marios Hadjieleftheriou, Nikos Mamoulis, Yufei Tao