2924 search results - page 112 / 585 » Lower Bounds in Distributed Computing |
239
click to vote
NETWORKS
2008
15 years 7 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
206
click to vote
RTSS
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications...
220
click to vote
JMLR
2010
15 years 2 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
191
Voted
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
157
Voted
CDC
2009
IEEE
16 years 4 days ago
2009
IEEE
Abstract— In this paper, the concept of restricted real perturbation values of a complex matrix triplet is introduced, and a formula for computing lower bounds of these values is...