168 search results - page 18 / 34 » On Nontrivial Approximation of CSPs |
208
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
178
click to vote
FLAIRS
2004
15 years 7 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
144
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
188
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
206
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...