51 search results - page 9 / 11 » An Improved Greedy Genetic Algorithm for Solving Travelling ... |
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
PVM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
CEC
2007
IEEE
13 years 9 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
ASIAN
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...