3874 search results - page 289 / 775 » Approximation Algorithms for k-hurdle Problems |
125
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
143
Voted
CD
2005
Springer
15 years 10 months ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
144
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
132
click to vote
TCS
2010
15 years 2 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
132
click to vote
TNN
1998
15 years 4 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...