Sciweavers

91 search results - page 4 / 19
» Routing Flow Through a Strongly Connected Graph
Sort
View
ANOR
2004
170views more  ANOR 2004»
13 years 7 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
ADHOC
2007
169views more  ADHOC 2007»
13 years 7 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
INFOCOM
2008
IEEE
14 years 1 months ago
On Maintaining Sensor-Actor Connectivity in Wireless Sensor and Actor Networks
—In wireless sensor and actor networks (WSANs), a group of sensors and actors are connected by a wireless medium to perform distributed sensing and acting tasks. Sensors usually ...
Jie Wu, Shuhui Yang, Mihaela Cardei
MP
1998
136views more  MP 1998»
13 years 7 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
IEEEHPCS
2010
13 years 6 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...