Sciweavers

319 search results - page 51 / 64
» An Analytical Comparison of Optimization Problem Generation ...
Sort
View
HAIS
2009
Springer
13 years 11 months ago
Pareto-Based Multi-output Model Type Selection
In engineering design the use of approximation models (= surrogate models) has become standard practice for design space exploration, sensitivity analysis, visualization and optimi...
Dirk Gorissen, Ivo Couckuyt, Karel Crombecq, Tom D...
DAC
2010
ACM
13 years 10 months ago
Eyecharts: constructive benchmarking of gate sizing heuristics
—Discrete gate sizing is one of the most commonly used, flexible, and powerful techniques for digital circuit optimization. The underlying problem has been proven to be NP-hard ...
Puneet Gupta, Andrew B. Kahng, Amarnath Kasibhatla...
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
14 years 13 hour ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...
JAIR
2006
121views more  JAIR 2006»
13 years 6 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
TPDS
1998
110views more  TPDS 1998»
13 years 6 months ago
On Exploiting Task Duplication in Parallel Program Scheduling
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
Ishfaq Ahmad, Yu-Kwong Kwok