7150 search results - page 388 / 1430 » An Approximation Algorithm for Approximation Rank |
205
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
199
click to vote
TSP
2008
15 years 6 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
237
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
219
click to vote
ATAL
2005
Springer
16 years 10 days ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
191
click to vote
ATMOS
2007
15 years 8 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...