1647 search results - page 51 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
142
click to vote
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
122
click to vote
STOC
2006
ACM
15 years 8 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
113
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
121
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
150
click to vote
ATAL
2005
Springer
15 years 8 months 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...