Sciweavers

5448 search results - page 113 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 11 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
IMC
2010
ACM
15 years 1 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
16 years 4 months ago
Timing Yield Calculation Using an Impulse-Train Approach
This paper presents a new method to compute the probability distribution of the delay of a combinational circuit and uses it obtain an estimate of the yield of the process that ma...
Srinath R. Naidu
227
Voted
PRDC
2007
IEEE
15 years 10 months ago
Implementation of a Flexible Membership Protocol on a Real-Time Ethernet Prototype
This paper describes the implementation of a processorgroup membership protocol in an experimental real-time network. The protocol is appropriate for fault-tolerant distributed sy...
Raul Barbosa, António Ferreira, Johan Karls...
IPPS
2005
IEEE
15 years 9 months ago
Towards Quantitative Analysis of Real-Time UML Using Stochastic Petri Nets
In recent years the Unified Modeling Language (UML) including its profiles gained increasing acceptance as a specification language for modeling real-time systems. It is crucia...
Jan Trowitzsch, Armin Zimmermann, Günter Homm...