12950 search results - page 2470 / 2590 » On Optimal Timed Strategies |
BMCBI
2010
13 years 8 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
BMCBI
2008
13 years 8 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
COR
2008
13 years 8 months ago
2008
We consider a firm that faces random demand and receives product from a single supplier who faces random supply. The supplier's availability may be affected by events such as...