Sciweavers

13214 search results - page 74 / 2643
» Pseudorandomness for network algorithms
Sort
View
CJ
2010
128views more  CJ 2010»
15 years 6 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
OL
2008
82views more  OL 2008»
15 years 5 months ago
An approximation algorithm for network design problems with downwards-monotone demand functions
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
Michael Laszlo, Sumitra Mukherjee
IPPS
1998
IEEE
15 years 10 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
ISCC
2006
IEEE
16 years 9 days ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
APNOMS
2007
Springer
16 years 14 days ago
The Primary Path Selection Algorithm for Ubiquitous Multi-homing Environments
The multi-homing technology can provide an extended coverage area via distinct access technologies. Also, it is able to redirect a flow from one interface to another without reinit...
Dae Sun Kim, Choong Seon Hong