832 search results - page 47 / 167 » Parallel algorithms for solving aggregated shortest-path pro... |
IPPS
2008
IEEE
15 years 4 months 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...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
IPPS
1997
IEEE
15 years 1 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...
HIPC
2003
Springer
15 years 2 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...
ICPP
2007
IEEE
15 years 4 months 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), ...