149 search results - page 18 / 30 » On Finding Minimum Deadly Sets for Directed Networks |
SRDS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Using a game-theoretic model combined with the evolutionary model, we investigate the conditions under which the desirable interaction rules will evolve and sustain in various ...
JMLR
2010
13 years 2 months ago
2010
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
ISAAC
2004
Springer
14 years 27 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...