Sciweavers

1559 search results - page 62 / 312
» Heuristic Approaches to Energy-Efficient Network Design Prob...
Sort
View
90
Voted
JSAC
2006
157views more  JSAC 2006»
14 years 11 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
AAAI
2004
15 years 10 days ago
Towards Autonomic Computing: Adaptive Job Routing and Scheduling
Computer systems are rapidly becoming so complex that maintaining them with human support staffs will be prohibitively expensive and inefficient. In response, visionaries have beg...
Shimon Whiteson, Peter Stone
FPL
2008
Springer
126views Hardware» more  FPL 2008»
15 years 14 days ago
Customized Reconfigurable Interconnection Networks for multiple application SOCS
A Customized Reconfigurable Interconnection Network (CRIN) refers to a minimal switching network, yielding routing solutions for any element in a pre-given set of routing requirem...
Hongbing Fan, Jason Ernst, Yu-Liang Wu
80
Voted
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
15 years 9 hour ago
An evolutionary design technique for collective communications on optimal diameter-degree networks
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
Jirí Jaros, Vaclav Dvorak
DCOSS
2007
Springer
15 years 5 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao