Sciweavers

13214 search results - page 343 / 2643
» Pseudorandomness for network algorithms
Sort
View
GIS
2009
ACM
15 years 10 months ago
A new perspective on efficient and dependable vehicle routing
The essential elements of any navigation system are a shortest-path algorithm and accurate map data. The contribution of this work is two-fold. First, the HBA algorithm, an effici...
Dieter Pfoser, Alexandros Efentakis, Agnès ...
TIME
2006
IEEE
16 years 24 days ago
Ultimately Periodic Simple Temporal Problems (UPSTPs)
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
Jean-François Condotta, Gérard Ligoz...
LCN
2007
IEEE
16 years 1 months ago
Emergency Evacuation using Wireless Sensor Networks
—This paper presents a distributed algorithm to direct evacuees to exits through arbitrarily complex building layouts in emergency situations. The algorithm finds the safest pat...
Matthew Barnes, Hugh Leather, D. K. Arvind
IJSNET
2007
100views more  IJSNET 2007»
15 years 6 months ago
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
Feng Wang 0002, Kuai Xu, My T. Thai, Ding-Zhu Du
TON
2008
79views more  TON 2008»
15 years 6 months ago
Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time,...
Loc Bui, Atilla Eryilmaz, R. Srikant, Xinzhou Wu