13214 search results - page 133 / 2643 » Pseudorandomness for network algorithms |
146
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
159
click to vote
PDCAT
2007
Springer
16 years 17 days ago
2007
Springer
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks (INs) in such supercomputers play an important role. ...
197
click to vote
CSB
2005
IEEE
16 years 2 days ago
2005
IEEE
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we ...
171
click to vote
WIOPT
2005
IEEE
16 years 1 days ago
2005
IEEE
This paper evaluates a self-organizing routing protocol for Ad Hoc network, called the NEUron Routing ALgorithm (NEURAL). NEURAL has been designed taking into account the learning...
161
click to vote
WOWMOM
2005
ACM
16 years 12 hour ago
2005
ACM
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...