Sciweavers

3809 search results - page 10 / 762
» Randomized Broadcast in Networks
Sort
View
SAC
2008
ACM
13 years 7 months ago
Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access
The weakly pulse-coupled oscillator framework has proven to be a valuable resource for the development of peer-to-peer synchronization algorithms [9]. But leveraging it in a pract...
Julius Degesys, Prithwish Basu, Jason Redi
SAC
1996
ACM
14 years 9 hour ago
A genetic algorithm for the minimum broadcast time problem using a global precedence vector
The problem of broadcasting a message through a network is considered. The objective is to minimize the number of time steps necessary to complete the broadcast. This problem is k...
Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wa...
ISAAC
1994
Springer
80views Algorithms» more  ISAAC 1994»
13 years 12 months ago
Unifying Themes for Network Selection
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
WIOPT
2011
IEEE
12 years 11 months ago
Broadcasting with a battery limited energy harvesting rechargeable transmitter
—We consider the minimization of the transmission completion time with a battery limited energy harvesting transmitter in a two-user AWGN broadcast channel. The transmitter has ...
Omur Ozel, Jing Yang, Sennur Ulukus
ICIP
2008
IEEE
14 years 2 months ago
Rate-efficient visual correspondences using random projections
We consider the problem of establishing visual correspondences in a distributed and rate-efficient fashion by broadcasting compact descriptors. Establishing visual correspondence...
Chuohao Yeo, Parvez Ahammad, Kannan Ramchandran