Sciweavers

4335 search results - page 526 / 867
» Privatizing Constraint Optimization
Sort
View
AI
2010
Springer
15 years 4 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 3 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan
TON
2010
163views more  TON 2010»
15 years 3 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
ICC
2009
IEEE
136views Communications» more  ICC 2009»
15 years 2 months ago
Maximizing the Sum Rate in Symmetric Networks of Interfering Links
We consider the power optimization problem of maximizing the sum rate of a symmetric network of interfering links in Gaussian noise. All transmitters have an average transmit power...
Sibi Raj Bhaskaran, Stephen V. Hanly, Nasreen Badr...
NHM
2010
87views more  NHM 2010»
14 years 11 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...