Sciweavers

337 search results - page 20 / 68
» Optimizing yield in global routing
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
CN
2004
98views more  CN 2004»
13 years 7 months ago
On selection of candidate paths for proportional routing
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
Srihari Nelakuditi, Zhi-Li Zhang, David Hung-Chang...
APPROX
2009
Springer
105views Algorithms» more  APPROX 2009»
13 years 5 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions....
Ronald Koch, Britta Peis, Martin Skutella, Andreas...
RTS
2011
131views more  RTS 2011»
13 years 2 months ago
Global scheduling based reliability-aware power management for multiprocessor real-time systems
Reliability-aware power management (RAPM) has been a recent research focus due the negative effects of the popular power management technique dynamic voltage and frequency scaling ...
Xuan Qi, Dakai Zhu, Hakan Aydin
ARCS
2004
Springer
14 years 1 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler