639 search results - page 28 / 128 » Comparative analysis of genetic algorithm implementations |
127
Voted
EUROGP
2008
Springer
15 years 4 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, ...
145
Voted
TWC
2008
2008
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
15 years 2 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...
141
Voted
CSC
2009
15 years 3 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...
140
Voted
SCCC
2000
IEEE
15 years 6 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...
125
Voted
GECCO
2004
Springer
15 years 8 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...