Sciweavers

732 search results - page 84 / 147
» Termination of Integer Linear Programs
Sort
View
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
14 years 2 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
14 years 2 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
INFOCOM
2002
IEEE
14 years 2 months ago
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
Dirceu Cavendish, Bhaskar Sengupta
LCTRTS
2001
Springer
14 years 1 months ago
ILP-based Instruction Scheduling for IA-64
The IA-64 architecture has been designed as a synthesis of VLIW and superscalar design principles. It incorporates typical functionality known from embedded processors as multiply...
Daniel Kästner, Sebastian Winkel
DAC
1999
ACM
14 years 1 months ago
On ILP Formulations for Built-In Self-Testable Data Path Synthesis
In this paper, we present a new method to the built-in selftestable data path synthesis based on integer linear programming (ILP). Our method performs system register assignment, ...
Han Bin Kim, Dong Sam Ha, Takeshi Takahashi