Sciweavers

837 search results - page 96 / 168
» Distributed algorithms for reaching consensus on general fun...
Sort
View
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
14 years 8 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
ALMOB
2006
80views more  ALMOB 2006»
14 years 9 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
JSAC
1998
126views more  JSAC 1998»
14 years 9 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
BMCBI
2007
156views more  BMCBI 2007»
14 years 9 months ago
Predictive modeling of plant messenger RNA polyadenylation sites
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
Guoli Ji, Jianti Zheng, Yingjia Shen, Xiaohui Wu, ...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
15 years 10 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...