Sciweavers

425 search results - page 42 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
ICPADS
2005
IEEE
14 years 2 months ago
Efficient Distributed QoS Routing Protocol for MPLS Networks
- This paper proposes a new distributed QoS routing protocol, called Efficient Distributed QoS Routing (EDQR), for MPLS networks. The path searching algorithm of EDQR considers an ...
Man-Ching Yuen, Weijia Jia, Chi-Chung Cheung
CEC
2010
IEEE
13 years 13 days ago
Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team
—Mobile cooperative sensor networks are increasingly used for surveillance and reconnaissance tasks to support domain picture compilation. However, efficient distributed informat...
Jean Berger, Jens Happe
ICPADS
2006
IEEE
14 years 2 months ago
Efficient Compile-Time Task scheduling for Heterogeneous Distributed Computing Systems
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
Mohammad I. Daoud, Nawwaf N. Kharma
ICDCS
2007
IEEE
14 years 3 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
14 years 21 days ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano