Sciweavers

613 search results - page 3 / 123
» Finding and Fixing Faults
Sort
View
IPL
2006
105views more  IPL 2006»
13 years 5 months ago
Finding and counting cliques and independent sets in r-uniform hypergraphs
We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the runn...
Raphael Yuster
DAGSTUHL
2004
13 years 7 months ago
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
William I. Gasarch, Frank Stephan
CLIMA
2004
13 years 7 months ago
Fault Tolerant and Fixed Scalable Structure of Middle-Agents
Middle-agents are used by end-agents to locate service providers in multi-agent systems. One central middle-agent represents a single point of failure and communication bottleneck ...
Pavel Tichý
SIROCCO
2008
13 years 7 months ago
Locating and Repairing Faults in a Network with Mobile Agents
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
Colin Cooper, Ralf Klasing, Tomasz Radzik
IPPS
2007
IEEE
14 years 2 days ago
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications
Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the dom...
Cristian Tapus, David A. Noblet