337 search results - page 23 / 68 » Semidefinite Programming Based Approximation Algorithms |
NIPS
2007
13 years 9 months ago
2007
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
CP
2009
Springer
14 years 8 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
DAC
2009
ACM
13 years 11 months ago
2009
ACM
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...