7930 search results - page 56 / 1586 » Greedy in Approximation Algorithms |
107
click to vote
DAC
1995
ACM
15 years 6 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
112
click to vote
CIMAGING
2008
15 years 4 months ago
2008
This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements
115
Voted
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
121
click to vote
ECML
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present first experiments using Support Vector Regression as function approximator for an on-line, sarsa-like reinforcement learner. To overcome the batch nature of S...
149
Voted
HEURISTICS
1998
15 years 2 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...