895 search results - page 94 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
119
Voted
CEC
2007
IEEE
15 years 9 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
128
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
117
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
115
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
153
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...