2698 search results - page 157 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
181
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
155
click to vote
ADHOC
2010
15 years 6 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
164
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
211
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
185
click to vote
CCE
2004
15 years 6 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...