5316 search results - page 106 / 1064 » Which Search Problems Are Random |
127
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
127
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
152
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
136
click to vote
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
146
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...