Sciweavers

3218 search results - page 535 / 644
» Timed Extensions for SDL
Sort
View
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
15 years 10 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
IWQOS
2004
Springer
15 years 10 months ago
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
Theodoros Salonidis, Leandros Tassiulas
173
Voted
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
15 years 10 months ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...
IPPS
2003
IEEE
15 years 10 months ago
Distributed P2P Computing within Triana: A Galaxy Visualization Test Case
We discuss here a parallel implementation of the visualisation of data from a galaxy formation simulation within the Triana problem-solving environment. The visualisation is a tes...
Ian J. Taylor, Matthew S. Shields, Ian Wang, Roger...
RTAS
2003
IEEE
15 years 10 months ago
Kernel Support for Open QoS-Aware Computing
Most research on QoS-aware computing considers systems where code is generally partitioned into separately schedulable tasks with associated timing constraints. In sharp contrast ...
Ronghua Zhang, Tarek F. Abdelzaher, John A. Stanko...