895 search results - page 17 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
ESA
2005
Springer
15 years 4 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
ICML
2001
IEEE
15 years 11 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
KDD
2007
ACM
15 years 11 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
71
Voted
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...