Sciweavers

657 search results - page 84 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
TCAD
2002
93views more  TCAD 2002»
15 years 3 months ago
Hierarchical buffered routing tree generation
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
Amir H. Salek, Jinan Lou, Massoud Pedram
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
15 years 5 months 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
156
Voted
CCCG
2003
15 years 5 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
DAC
1995
ACM
15 years 7 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
146
Voted
INFOCOM
2002
IEEE
15 years 9 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...