Sciweavers

74 search results - page 8 / 15
» Problem Generators for Rectangular packing problems
Sort
View
JEC
2006
73views more  JEC 2006»
14 years 9 months ago
Frame packing algorithms for automotive applications
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
Rishi Saket, Nicolas Navet
82
Voted
ATMOS
2007
119views Optimization» more  ATMOS 2007»
14 years 11 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
ATMOS
2010
163views Optimization» more  ATMOS 2010»
14 years 8 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...
COR
2007
87views more  COR 2007»
14 years 9 months ago
An exact algorithm for generating homogenous T-shape cutting patterns
Both the material usage and the complexity of the cutting process should be considered in generating cutting patterns. This paper presents an exact algorithm for constrained two-d...
Yaodong Cui
ASPDAC
2009
ACM
104views Hardware» more  ASPDAC 2009»
15 years 4 months ago
Addressing thermal and power delivery bottlenecks in 3D circuits
— The enhanced packing densities facilitated by 3D integrated circuit technology also has an unwanted side-effect, in the form of increasing the amount of current per unit footpr...
Sachin S. Sapatnekar