Sciweavers

ISCI
2008
107views more  ISCI 2008»
13 years 3 months ago
Constructing vertex-disjoint paths in (n, k)-star graphs
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...
Tsung-Chi Lin, Dyi-Rong Duh
CJ
1999
95views more  CJ 1999»
13 years 4 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
FUIN
2000
85views more  FUIN 2000»
13 years 4 months ago
Stubborn Sets for Model Checking the EF/AG Fragment of CTL
The general stubborn set approach to CTL model checking 2] has the drawback that one either nds a stubborn set with only one enabled transition or one has to expand all enabled tra...
Karsten Schmidt 0004
JPDC
2008
115views more  JPDC 2008»
13 years 4 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...