Sciweavers

14386 search results - page 74 / 2878
» The Chinese Generals Problem
Sort
View
ICML
2001
IEEE
16 years 4 months ago
General Loss Bounds for Universal Sequence Prediction
The Bayesian framework is ideally suited for induction problems. The probability of observing xt at
Marcus Hutter
JCST
2008
85views more  JCST 2008»
15 years 3 months ago
A General Approach to L ( h, k )-Label Interconnection Networks
d Abstract) Tiziana Calamoneri 1 , Saverio Caminiti 2 , and Rossella Petreschi 3 Dipartimento di Informatica Universit`a degli Studi di Roma "La Sapienza" Via Salaria 113...
Tiziana Calamoneri, Saverio Caminiti, Rossella Pet...
126
Voted
JCNS
2010
103views more  JCNS 2010»
14 years 10 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski
120
Voted
JPDC
2008
115views more  JPDC 2008»
15 years 3 months ago
On Byzantine generals with alternative plans
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
Miguel Correia, Alysson Neves Bessani, Paulo Ver&i...
JPDC
2006
85views more  JPDC 2006»
15 years 3 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...