Sciweavers

373 search results - page 61 / 75
» On the Iterated Hairpin Completion
Sort
View
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
FSTTCS
1993
Springer
13 years 11 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
CAV
2000
Springer
187views Hardware» more  CAV 2000»
13 years 11 months ago
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
Poul Frederick Williams, Armin Biere, Edmund M. Cl...
COLT
2008
Springer
13 years 9 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
BMCBI
2007
116views more  BMCBI 2007»
13 years 7 months ago
MED: a new non-supervised gene prediction algorithm for bacterial and archaeal genomes
Background: Despite a remarkable success in the computational prediction of genes in Bacteria and Archaea, a lack of comprehensive understanding of prokaryotic gene structures pre...
Huaiqiu Zhu, Gang-Qing Hu, Yi-Fan Yang, Jin Wang, ...