Sciweavers

819 search results - page 77 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
134
Voted
BMCBI
2008
149views more  BMCBI 2008»
15 years 2 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
Olivier Bastien, Eric Maréchal
139
Voted
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 11 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
145
Voted
EMSOFT
2001
Springer
15 years 7 months ago
Interface Theories for Component-Based Design
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
Luca de Alfaro, Thomas A. Henzinger
156
Voted
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 6 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
107
Voted
AAAI
2010
15 years 20 days ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen