Sciweavers

583 search results - page 16 / 117
» Computing Linking Numbers of a Filtration
Sort
View
PODC
2003
ACM
14 years 3 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
PERCOM
2006
ACM
14 years 9 months ago
QoS Routing in OLSR with Several Classes of Service
The Optimized Link State Routing (OLSR) protocol is a proactive link-state protocol bafor ad-hoc networks. It uses an optimization called Multi-Point Relays (MPRs) to provide an e...
Jeremie Leguay, Timur Friedman
AINA
2008
IEEE
13 years 12 months ago
3MOKAN: A Novel Mobility Management Mechanism Based on Keeping Alternative Nodes
A mobile ad hoc network (MANET) is a network without any predefined infrastructure in which every node not only enjoys the services from the network, but serves the network as a r...
Mahmood Hasanlou, Ebrahim Fazli, Ali Movaghar, Hos...
STACS
2005
Springer
14 years 3 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...
ICCS
2004
Springer
14 years 3 months ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo