Sciweavers

4894 search results - page 864 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
FORTE
2004
13 years 9 months ago
Symbolic Diagnosis of Partially Observable Concurrent Systems
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
Thomas Chatain, Claude Jard
NETWORKING
2004
13 years 9 months ago
Multi-domain Diagnosis of End-to-End Service Failures in Hierarchically Routed Networks
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...
Malgorzata Steinder, Adarshpal S. Sethi
OPODIS
2004
13 years 9 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
NIPS
2001
13 years 9 months ago
The Emergence of Multiple Movement Units in the Presence of Noise and Feedback Delay
Tangential hand velocity profiles of rapid human arm movements often appear as sequences of several bell-shaped acceleration-deceleration phases called submovements or movement un...
Michael Kositsky, Andrew G. Barto
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 9 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir