Sciweavers

9233 search results - page 1738 / 1847
» Sharing sensor networks
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
15 years 10 months ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
ATAL
2000
Springer
15 years 10 months ago
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
Bradley J. Clement, Edmund H. Durfee
FTDCS
1999
IEEE
15 years 10 months ago
Priority Scheduling and Buffer Management for ATM Traffic Shaping
The impact of buffer management and priority scheduling is examined in stressful scenarios when the aggregate incoming traffic is higher than the output link capacity of an Asynch...
Todd Lizambri, Fernando Duran, Shukri Wakid
HCW
1999
IEEE
15 years 10 months ago
A Unified Resource Scheduling Framework for Heterogeneous Computing Environments
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
Ammar H. Alhusaini, Viktor K. Prasanna, Cauligi S....
HOTOS
1999
IEEE
15 years 10 months ago
The Box: A Replacement for Files
The file is a well-understood and very simple abstraction, which has been successfully used in both centralized and distributed systems. However, files are not expressive enough t...
Francisco J. Ballesteros, Sergio Arévalo
« Prev « First page 1738 / 1847 Last » Next »