Sciweavers

7978 search results - page 11 / 1596
» Combining shared-coin algorithms
Sort
View
BMCBI
2004
125views more  BMCBI 2004»
13 years 7 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner
JEA
2010
95views more  JEA 2010»
13 years 5 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
EVOW
2010
Springer
14 years 2 months ago
Start-Up Optimisation of a Combined Cycle Power Plant with Multiobjective Evolutionary Algorithms
Abstract. In this paper we present a study of the application of Evolutionary Computation methods to the optimisation of the start-up of a combined cycle power plant. We propose a ...
Ilaria Bertini, Matteo De Felice, Fabio Moretti, S...
CORR
2004
Springer
115views Education» more  CORR 2004»
13 years 7 months ago
An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
: In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non...
Florentin Smarandache, Jean Dezert
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 1 months ago
An efficient static algorithm for computing the soft error rates of combinational circuits
Soft errors have emerged as an important reliability challenge for nanoscale VLSI designs. In this paper, we present a fast and efficient soft error rate (SER) computation algorit...
Rajeev R. Rao, Kaviraj Chopra, David Blaauw, Denni...