661 search results - page 106 / 133 » On Distributed Computation in Noisy Random Planar Networks |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
103
click to vote
HIPC
2007
Springer
15 years 1 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
QUESTA
2011
14 years 16 days ago
2011
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
ISPA
2005
Springer
15 years 3 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
ALGOSENSORS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...