Sciweavers

4642 search results - page 636 / 929
» Distributed algorithm and reversible network
Sort
View
NCA
2005
IEEE
15 years 9 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...
149
Voted
COMCOM
2007
136views more  COMCOM 2007»
15 years 3 months ago
Demand-scalable geographic multicasting in wireless sensor networks
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
Shibo Wu, K. Selçuk Candan
123
Voted
GD
2004
Springer
15 years 8 months ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
CCECE
2009
IEEE
15 years 8 months ago
Cluster head selection using RF signal strength
The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the...
Scott Fazackerley, Alan Paeth, Ramon Lawrence
SPAA
2005
ACM
15 years 9 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder