7167 search results - page 432 / 1434 » Answer Set Programming |
125
Voted
ESEC
1997
Springer
15 years 8 months ago
1997
Springer
Software architectures shift developers’ focus from lines-of-code to coarser-grained architectural elements and their interconnection structure. Architecture description language...
134
Voted
APPROX
2010
Springer
15 years 5 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...
125
click to vote
DAGSTUHL
2007
15 years 5 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...
128
click to vote
IPCO
2010
15 years 5 months ago
2010
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
151
click to vote
IPCO
2008
15 years 5 months ago
2008
We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to co...