| | |
Summary: Reachability Under Uncertainty
Allen Chang and Eyal Amir
Department of Computer Science
University of Illinois at Urbana-Champaign
Urbana, IL 61801
{achang, eyal}@uiuc.edu
Abstract
In this paper we introduce a new network
reachability problem where the goal is to find
the most reliable path between two nodes in
a network, represented as a directed acyclic
graph. Individual edges within this network
may fail according to certain probabilities,
and these failure probabilities may depend on
the values of one or more hidden variables.
This problem may be viewed as a general-
ization of shortest-path problems for finding
minimum cost paths or Viterbi-type prob-
lems for finding highest-probability sequences
of states, where the addition of the hidden
|
