Sciweavers

706 search results - page 17 / 142
» An Integer Linear Programming Approach to Database Design
Sort
View
83
Voted
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
15 years 3 months ago
An ILP Formulation for Yield-driven Architectural Synthesis
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
SAC
2009
ACM
15 years 4 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
PATAT
2004
Springer
135views Education» more  PATAT 2004»
15 years 2 months ago
A Column Generation Scheme for Faculty Timetabling
In this paper we deal with the problem of building a timetable for the courses of a university faculty. We propose an integer linear programming approach based on column generation...
Andrea Qualizza, Paolo Serafini
GLOBECOM
2007
IEEE
15 years 3 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
NETWORKS
2008
14 years 9 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...