Sciweavers

552 search results - page 82 / 111
» Lower bounds for dynamic connectivity
Sort
View
NETWORKING
2004
13 years 9 months ago
Traffic Grooming in WDM Ring Networks with the Min-Max Objective
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consid...
Bensong Chen, George N. Rouskas, Rudra Dutta
HPDC
2011
IEEE
12 years 11 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...
NETWORKING
2011
12 years 10 months ago
The Problem of Sensing Unused Cellular Spectrum
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...
Daniel Willkomm, Sridhar Machiraju, Jean Bolot, Ad...
DSN
2006
IEEE
14 years 2 months ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Antonio Fernández, Ernesto Jiménez, ...
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 1 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