994 search results - page 66 / 199 » Custom Computing Machines for the Set Covering Problem |
123
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...
DCOSS
2009
Springer
15 years 7 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
92
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
96
Voted
COLT
1997
Springer
15 years 4 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
101
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper analyzes the scalability of the population size required in XCS to maintain niches that are infrequently activated. Facetwise models have been developed to predict the ...