1486 search results - page 70 / 298 » Algorithms for two-box covering |
138
Voted
IPCO
2004
15 years 2 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
111
Voted
DCC
2008
IEEE
16 years 22 days ago
2008
IEEE
We propose an algorithm which is an improved version of the Kabatiansky-Tavernier list decoding algorithm for the second order binary Reed-Muller code RM(2, m), of length n = 2m , ...
95
Voted
ICALP
2005
Springer
15 years 6 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 ...
109
Voted
ESANN
2003
15 years 2 months ago
2003
In this paper we propose a new algorithm for rule extraction from a trained Multilayer Feedforward network. The algorithm is based on an interval arithmetic network inversion for p...
115
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...