1040 search results - page 104 / 208 » Rounding algorithms for covering problems |
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We are reviewing recent advances in the run time analysis of search tree algorithms, including indications to open problems. In doing so, we also try to cover the historical dimens...
ALGORITHMICA
2010
14 years 10 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The paper presents an approach for the anomaly detection problem based on principles of immune systems. Flexibility and efficiency of the anomaly detection system are achieved by ...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
DSD
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...