444 search results - page 82 / 89 » Solving Mastermind Using Genetic Algorithms |
110
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
121
Voted
CANDC
2006
ACM
15 years 15 days ago
2006
ACM
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
105
Voted
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
104
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
A genome rearrangement scenario describes a series of chromosome fusion, fission, and translocation operations that suffice to rewrite one genome into another. Exact algorithmic ...
105
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...