Sciweavers

7683 search results - page 1174 / 1537
» Distributed Computing with the CLAN Network
Sort
View
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
DSN
2007
IEEE
15 years 10 months ago
Automatic Verification and Discovery of Byzantine Consensus Protocols
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
Piotr Zielinski
DSN
2007
IEEE
15 years 10 months ago
Performability Models for Multi-Server Systems with High-Variance Repair Durations
We consider cluster systems with multiple nodes where each server is prone to run tasks at a degraded level of service due to some software or hardware fault. The cluster serves t...
Hans-Peter Schwefel, Imad Antonios
ICDCS
2010
IEEE
15 years 10 months ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
GPC
2007
Springer
15 years 10 months ago
Image Streaming and Recognition for Vehicle Location Tracking Using Mobile Devices
The image of a license plate is scanned by the camera attached to a mobile PDA device and the numbers on the plate are detected by the image processing parts in the proposed Mobile...
Jin-Suk Kang, Taikyeong T. Jeong, Sang Hyun Oh, Me...
« Prev « First page 1174 / 1537 Last » Next »