16404 search results - page 464 / 3281 » A set coverage problem |
214
click to vote
IPCO
2004
15 years 8 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...
169
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
A typical task in technical fault detection or medical diagnosis problems is to discriminate normal behavior from one or more types of abnormal behavior by means of different meas...
197
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
149
click to vote
PUK
2003
15 years 8 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
161
click to vote
CAS
2008
15 years 7 months ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...