11328 search results - page 68 / 2266 » Timed Branching Processes |
115
click to vote
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
130
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
212
click to vote
WSC
2004
15 years 4 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
152
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
114
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Semantic structures for belief revision are proposed. We start with one-stage revision structures that generalize the notion of choice function from rational choice theory. A corr...