Sciweavers

13214 search results - page 151 / 2643
» Pseudorandomness for network algorithms
Sort
View
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 12 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
TSP
2008
106views more  TSP 2008»
15 years 6 months ago
Distributed Spectrum Management Algorithms for Multiuser DSL Networks
Modern digital subscriber line (DSL) networks suffer from crosstalk among different lines in the same cable bundle. This crosstalk can lead to a major performance degradation. By b...
Paschalis Tsiaflakis, Moritz Diehl, Marc Moonen
DIALM
2000
ACM
114views Algorithms» more  DIALM 2000»
15 years 11 months ago
Leader election algorithms for mobile ad hoc networks
Ï ÔÖ × ÒØ ØÛÓ Ò Û Ð Ö Ð Ø ÓÒ Ð ÓÖ Ø Ñ× ÓÖ ÑÓ Ð Ó Ò ØÛÓÖ ×º Ì Ð ÓÖ Ø Ñ× Ò×ÙÖ Ø Ø Ú ÒØÙ ÐÐÝ ÓÒÒ Ø ÓÑÔÓÒ ÒØ Ó Ø ...
Navneet Malpani, Jennifer L. Welch, Nitin H. Vaidy...
WDAG
2000
Springer
68views Algorithms» more  WDAG 2000»
15 years 10 months ago
Approximation Algorithms for Survivable Optical Networks
Tamar Eilam, Shlomo Moran, Shmuel Zaks
ATAL
2010
Springer
15 years 7 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings