2694 search results - page 124 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
126
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
136
Voted
NETWORKING
2004
15 years 6 months ago
2004
The service overlay network (SON) is an effective mean to deploy end-to-end QoS guaranteed content delivery services on the current Internet. We model the content delivery service ...
166
click to vote
JMLR
2012
13 years 7 months ago
2012
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
125
click to vote
IJCAI
2001
15 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
121
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...