Sciweavers

13214 search results - page 409 / 2643
» Pseudorandomness for network algorithms
Sort
View
PODC
2006
ACM
16 years 25 days ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
IPSN
2007
Springer
16 years 1 months ago
Wireless localization using self-organizing maps
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...
IMC
2007
ACM
15 years 8 months ago
Studying wireless routing link metric dynamics
Multi-hop wireless mesh networks are increasingly being deployed for last-mile Internet access. Typically, network algorithms such as routing, channel assignment and topology cont...
Saumitra M. Das, Himabindu Pucha, Konstantina Papa...
SIROCCO
2008
15 years 8 months ago
Fast Radio Broadcasting with Advice
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo