Sciweavers

414 search results - page 19 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
GLOBECOM
2009
IEEE
15 years 1 months ago
Power Efficient Traffic Grooming in Optical WDM Networks
Abstract--Power-awareness in networking attracts more attention as the trends in the energy consumption of the Internet raise growing concerns about the environmental impacts and s...
Emre Yetginer, George N. Rouskas
88
Voted
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 2 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ICALP
2003
Springer
15 years 2 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
CASES
2006
ACM
15 years 3 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
75
Voted
ARC
2009
Springer
137views Hardware» more  ARC 2009»
15 years 4 months ago
Heterogeneous Architecture Exploration: Analysis vs. Parameter Sweep
This paper argues the case for the use of analytical models in FPGA architecture layout exploration. We show that the problem when simplified, is amenable to formal optimization t...
Asma Kahoul, George A. Constantinides, Alastair M....