Sciweavers

13214 search results - page 170 / 2643
» Pseudorandomness for network algorithms
Sort
View
JEA
2010
95views more  JEA 2010»
15 years 5 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
WCNC
2008
IEEE
16 years 27 days ago
On the Distribution of Positioning Errors in Wireless Sensor Networks: A Simulative Comparison of Optimization Algorithms
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
Stefano Tennina, Marco Di Renzo, Fortunato Santucc...
GLOBECOM
2006
IEEE
16 years 17 days ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
MIR
2003
ACM
213views Multimedia» more  MIR 2003»
15 years 11 months ago
Replication algorithms to retrieve scalable streaming media over Content Delivery Networks
CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed content servers. Replication Algorithm plays an ...
Zhou Su, Jiro Katto, Yasuhiko Yasuda
INFOCOM
2002
IEEE
15 years 11 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...