Sciweavers

5922 search results - page 78 / 1185
» Navigability of Complex Networks
Sort
View
115
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
99
Voted
IADIS
2003
15 years 2 months ago
Using Opnet Modeler to Analyse Galileo Communication Networks
Galileo is a European initiative to develop and deploy an independent global satellite-based navigation system. It consists of a Medium Earth Orbit sat ellite constellation transm...
Filipa Borrego, Juan-Antonio Martinez Rosique, Man...
125
Voted
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 7 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
90
Voted
COMPLEX
2009
Springer
15 years 7 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
109
Voted
ICDCN
2010
Springer
15 years 4 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan