6554 search results - page 889 / 1311 » Constraint Logic Programming |
181
click to vote
APPROX
2010
Springer
15 years 8 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...
151
click to vote
AAAI
2010
15 years 8 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(,...
174
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...
159
click to vote
NIPS
2007
15 years 8 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...
157
click to vote
FLAIRS
2006
15 years 8 months ago
2006
We are developing systems which play music on synthesized plucked strings instruments idiomatically. The present paper introduces a system focusing on the acoustic guitar. The sys...