Sciweavers

2109 search results - page 97 / 422
» Solving Necklace Constraint Problems
Sort
View
SAT
2004
Springer
109views Hardware» more  SAT 2004»
15 years 10 months ago
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
Alessandro Armando, Claudio Castellini, Enrico Giu...
142
Voted
AMW
2010
15 years 6 months ago
On Incomplete XML Documents with Integrity Constraints
We consider incomplete specifications of XML documents in the presence of schema information and integrity constraints. We show that integrity constraints such as keys and foreign ...
Pablo Barceló, Leonid Libkin, Juan L. Reutt...
CP
1997
Springer
15 years 9 months ago
GENIUS-CP: a Generic Single-Vehicle Routing Algorithm
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
Gilles Pesant, Michel Gendreau, Jean-Marc Rousseau
111
Voted
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 5 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
122
Voted
ICASSP
2008
IEEE
15 years 11 months ago
Robust adaptive beamforming for general-rank signal models using positive semi-definite covariance constraint
In this paper, we develop an improved approach to the worstcase robust adaptive beamforming for general-rank signal models by means of taking into account the positive semi-defin...
Haihua Chen, Alex B. Gershman