Sciweavers

11 search results - page 1 / 3
» Optimal PNNI complex node representations for restrictive co...
Sort
View
COMCOM
2004
85views more  COMCOM 2004»
13 years 10 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
STACS
2001
Springer
14 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
EMSOFT
2009
Springer
14 years 2 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
SMA
1999
ACM
152views Solid Modeling» more  SMA 1999»
14 years 2 months ago
Fast volume-preserving free form deformation using multi-level optimization
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
Gentaro Hirota, Renee Maheshwari, Ming C. Lin