805 search results - page 113 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Image reconstruction problems in radio astronomy and other fields like biomedical imaging are often ill-posed and some form of regularization is required. This imposes user speci...
APPROX
2010
Springer
15 years 1 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...
121
click to vote
UAI
1997
15 years 1 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
COR
2006
14 years 12 months ago
2006
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...