Sciweavers

1561 search results - page 305 / 313
» Probability Theory on IF Events
Sort
View
SPAA
2010
ACM
14 years 9 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
AI
2008
Springer
14 years 9 months ago
Strategic bidding in continuous double auctions
In this paper, we describe a novel bidding strategy that autonomous trading agents can use to participate in Continuous Double Auctions (CDAs). Our strategy is based on both short...
Perukrishnen Vytelingum, Dave Cliff, Nicholas R. J...
BMCBI
2008
111views more  BMCBI 2008»
14 years 9 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
BMCBI
2008
102views more  BMCBI 2008»
14 years 9 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 9 months ago
Evolution with Drifting Targets
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
Varun Kanade, Leslie G. Valiant, Jennifer Wortman ...