Sciweavers

708 search results - page 9 / 142
» Timing closure: the solution and its problems
Sort
View
AOR
2010
14 years 7 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
MIXER
2004
14 years 11 months ago
FixIt: An Approach towards Assisting Workers in Diagnosing Machine Malfunctions
Augmented Reality (AR) is a newly emerging user interface paradigm that is currently under rapid development. AR is still in its infancy. Only very few cases exist, in which AR te...
Gudrun Klinker, Hesam Najafi, Tobias Sielhorst, Fa...
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
15 years 3 months ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
SPAA
2005
ACM
15 years 3 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 2 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria