139 search results - page 15 / 28 » A Grid-enabled Branch and Bound Algorithm for Solving Challe... |
HIS
2008
13 years 9 months ago
2008
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This ...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
EOR
2008
13 years 7 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
GECCO
2003
Springer
14 years 27 days ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...