3874 search results - page 256 / 775 » Approximation Algorithms for k-hurdle Problems |
121
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
135
click to vote
WAOA
2005
Springer
15 years 10 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
158
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
122
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...