639 search results - page 28 / 128 » Comparative analysis of genetic algorithm implementations |
EUROGP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Turing machines are playing an increasingly significant role in Computer Science domains such as bioinformatics. Instead of directly formulating a solution to a problem, ...
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
13 years 7 months ago
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
CSC
2009
13 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
SCCC
2000
IEEE
13 years 12 months ago
2000
IEEE
Knowledge discovery is the most desirable end product of an enterprise information system. Researches from different areas recognize that a new generation of intelligent tools for...
GECCO
2004
Springer
14 years 28 days 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...