2864 search results - page 347 / 573 » Constraint Programming in OPL |
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The design of critical embedded real-time systems requires high confidence in the architecture and the implemented functionalities. Classically, such functions are suppor...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
AAAI
2010
13 years 10 months ago
2010
Consistency properties and algorithms for achieving them are at the heart of the success of Constraint Programming. In this paper, we study the relational consistency property R(,...
DAGSTUHL
2007
13 years 10 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...
NIPS
2007
13 years 10 months ago
2007
Most models of decision-making in neuroscience assume an infinite horizon, which yields an optimal solution that integrates evidence up to a fixed decision threshold; however, u...