Sciweavers

559 search results - page 33 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 7 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
13 years 7 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 1 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
SSD
2007
Springer
116views Database» more  SSD 2007»
14 years 1 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
ATAL
2005
Springer
14 years 1 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe