Sciweavers

2050 search results - page 136 / 410
» constraints 2010
Sort
View
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
13 years 12 months ago
Approximate Lasserre Integrality Gap for Unique Games
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...
Subhash Khot, Preyas Popat, Rishi Saket
AAAI
2010
13 years 11 months ago
A First Practical Algorithm for High Levels of Relational Consistency
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(,...
Shant Karakashian, Robert J. Woodward, Christopher...
CCGRID
2010
IEEE
13 years 11 months ago
Bandwidth Allocation for Iterative Data-Dependent E-science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous Dataflow (SDF) model, our framework inco...
Eun-Sung Jung, Sanjay Ranka, Sartaj Sahni
DEXA
2010
Springer
156views Database» more  DEXA 2010»
13 years 11 months ago
Improving Alternative Text Clustering Quality in the Avoiding Bias Task with Spectral and Flat Partition Algorithms
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
M. Eduardo Ares, Javier Parapar, Alvaro Barreiro
ICASSP
2010
IEEE
13 years 10 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro