895 search results - page 21 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
CAINE
2003
13 years 8 months ago
2003
Clustering is the process of subdividing an input data set into a desired number of subgroups so that members of the same subgroup are similar and members of different subgroups h...
GECCO
2006
Springer
13 years 11 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...
AICCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
HIS
2008
13 years 8 months ago
2008
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
APPROX
2005
Springer
14 years 28 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...