1310 search results - page 93 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
140
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
149
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we ...
145
click to vote
AAAI
2004
15 years 7 months ago
2004
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
187
click to vote
ERCIMDL
2000
Springer
15 years 9 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
149
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
The problem of multiple sequence alignment is important for bioinformatics. This problem is widely studied and a popular tool to solve this problem is Clustal X. This work introdu...