Sciweavers

4007 search results - page 532 / 802
» Computation with imprecise probabilities
Sort
View
PDCAT
2005
Springer
16 years 3 days ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song
PDCAT
2005
Springer
16 years 3 days ago
LRC-RED: A Self-tuning Robust and Adaptive AQM Scheme
In this paper, we propose a novel active queue management (AQM) scheme based on the Random Early Detection (RED) of the loss ratio and the total sending rate control, called LRC-R...
Naixue Xiong, Yan Yang, Xavier Défago, Yanx...
SAC
2004
ACM
16 years 1 days ago
Guiding motif discovery by iterative pattern refinement
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
Zhiping Wang, Mehmet M. Dalkilic, Sun Kim
SIGOPSE
2004
ACM
16 years 1 days ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
15 years 12 months ago
Estimating the size of the telephone universe: a Bayesian Mark-recapture approach
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...
David Poole