Sciweavers

8497 search results - page 246 / 1700
» Design for an Optimal Probe
Sort
View
FSTTCS
2009
Springer
15 years 11 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
ICCAD
2000
IEEE
188views Hardware» more  ICCAD 2000»
15 years 9 months ago
Bus Optimization for Low-Power Data Path Synthesis Based on Network Flow Method
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
Sungpack Hong, Taewhan Kim
WSC
2004
15 years 6 months ago
Optimal Computing Budget Allocation for Multi-Objective Simulation Models
Simulation plays a vital role in identifying the best system design from among a set of competing designs. To improve simulation efficiency, ranking and selection techniques are o...
Loo Hay Lee, Ek Peng Chew, Suyan Teng, David Golds...
TCAD
2008
103views more  TCAD 2008»
15 years 4 months ago
Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Latency-insensitive protocols allow system-on-chip (SoC) engineers to decouple the design of the computing cores from the design of the intercore communication channels while follo...
Rebecca L. Collins, Luca P. Carloni
ICCAD
2007
IEEE
115views Hardware» more  ICCAD 2007»
16 years 1 months ago
Timing optimization by restructuring long combinatorial paths
—We present an implementation of an algorithm for constructing provably fast circuits for a class of Boolean functions with input signals that have individual starting times. We ...
Jürgen Werber, Dieter Rautenbach, Christian S...