613 search results - page 37 / 123 » Finding and Fixing Faults |
AAECC
2009
Springer
15 years 29 days ago
2009
Springer
In this paper a full categorization of irreducible classical Goppa codes of degree 4 and length 9 is given. It is an interesting example in the context of find the number of permut...
ARSCOM
2008
14 years 12 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
By studying trouble tickets from small enterprise networks, we conclude that their operators need detailed fault diagnosis. That is, the diagnostic system should be able to diagno...
106
click to vote
HPCA
2003
IEEE
16 years 5 days ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
107
click to vote
NOMS
2002
IEEE
15 years 4 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...