3874 search results - page 221 / 775 » Approximation Algorithms for k-hurdle Problems |
145
click to vote
IJSNET
2007
15 years 4 months ago
2007
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
121
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
115
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper is concerned with approximate delay computation algorithms for combinational circuits. As a result of intensive research in the early 90’s [3, 8] efficient tools exi...
169
click to vote
ATAL
2005
Springer
15 years 9 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...
154
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...