1310 search results - page 98 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
134
click to vote
IPPS
2008
IEEE
16 years 14 days ago
2008
IEEE
Studies of gene expression using high-density oligonucleotide microarrays have become standard in a variety of biological contexts. The data recorded using the microarray techniqu...
167
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
158
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
161
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
171
Voted
HIPC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...