1310 search results - page 99 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
155
click to vote
ICPP
2007
IEEE
16 years 11 days ago
2007
IEEE
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
157
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
160
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
148
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
164
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...