1142 search results - page 118 / 229 » Approximability of Clausal Constraints |
165
click to vote
HM
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
179
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
166
click to vote
AAIM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
165
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
155
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--This paper addresses the problem of efficient representation of scenes captured by distributed omnidirectional vision sensors. We propose a novel geometric model to descr...