3874 search results - page 441 / 775 » Approximation Algorithms for k-hurdle Problems |
163
Voted
SIGECOM
2005
ACM
16 years 6 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
210
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
213
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
176
click to vote
APPROX
2005
Springer
16 years 6 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
153
click to vote
AAIM
2008
Springer
16 years 1 months ago
2008
Springer
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...