103 search results - page 20 / 21 » Minimal Separating Sequences for All Pairs of States |
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
JSAC
2006
13 years 5 months ago
2006
As networks grow in size and complexity, both the probability and the impact of failures increase. The pre-allocated backup bandwidth, which has been widely investigated in the lit...
OSDI
2002
ACM
14 years 6 months ago
2002
ACM
Many system errors do not emerge unless some intricate sequence of events occurs. In practice, this means that most systems have errors that only trigger after days or weeks of ex...
IOR
2007
13 years 5 months ago
2007
We analyze a general market for an industry of competing service facilities. Firms differentiate themselves by their price levels and the waiting time their customers experience,...
ECEASST
2006
13 years 5 months ago
2006
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...