Sciweavers

16404 search results - page 91 / 3281
» A set coverage problem
Sort
View
COMPGEOM
2001
ACM
15 years 6 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
16 years 3 months ago
The online set cover problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbi...
PODC
1999
ACM
15 years 7 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
HIS
2008
15 years 4 months ago
Evolutionary Training Set Selection to Optimize C4.5 in Imbalanced Problems
Classification in imbalanced domains is a recent challenge in machine learning. We refer to imbalanced classification when data presents many examples from one class and few from ...
Salvador García, Francisco Herrera
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 3 months ago
An Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
Uwe Aickelin