Sciweavers

94 search results - page 11 / 19
» An Integer Linear Programming Based Routing Algorithm for Fl...
Sort
View
TON
2010
118views more  TON 2010»
13 years 5 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 27 days ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ICC
2008
IEEE
175views Communications» more  ICC 2008»
14 years 1 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...
MONET
2008
77views more  MONET 2008»
13 years 7 months ago
On Relay Node Placement and Assignment for Two-tiered Wireless Networks
Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing Relay Nodes (RNs) can...
Wenxuan Guo, Xin-Ming Huang, Wenjing Lou, Cao Lian...
ICASSP
2011
IEEE
12 years 11 months ago
Heterogeneous multiprocessor mapping for real-time streaming systems
Real-time streaming signal processing systems typically desire high throughput and low latency. Many such systems can be modeled as synchronous data flow graphs. In this paper, w...
Jing Lin, Akshaya Srivatsa, Andreas Gerstlauer, Br...