Sciweavers

82 search results - page 12 / 17
» Tight bounds for clock synchronization
Sort
View
WDAG
1994
Springer
104views Algorithms» more  WDAG 1994»
13 years 11 months ago
Fast Increment Registers
We give an optimal, wait-free implementation of an increment register. An increment register is a concurrent object consisting of an integer-valued register with an increment oper...
Soma Chaudhuri, Mark R. Tuttle
ICRA
2008
IEEE
165views Robotics» more  ICRA 2008»
14 years 2 months ago
An almost communication-less approach to task allocation for multiple Unmanned Aerial Vehicles
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
Peng Cheng, Vijay Kumar
ETFA
2006
IEEE
14 years 1 months ago
Implementation of an Internet-controlled system under variable delays
Abstract— This work deals with the control and the observation of a remote system using Internet as a communication line. The process consists in a Slave part S, with poor comput...
Alexandre Seuret, M. Termens-Ballester, A. Toguyen...
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
14 years 4 months ago
A Two-Layer Bus Routing Algorithm for High-Speed Boards
The increasing clock frequencies in high-end industrial circuits bring new routing challenges that can not be handled by traditional algorithms. An important design automation pro...
Muhammet Mustafa Ozdal, Martin D. F. Wong
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 8 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl