Sciweavers

2714 search results - page 30 / 543
» Approximation Schemes for Scheduling
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 10 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
131
Voted
JCO
2011
115views more  JCO 2011»
14 years 10 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
CSR
2007
Springer
15 years 9 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
152
Voted
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 6 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
WINE
2010
Springer
153views Economy» more  WINE 2010»
15 years 1 months ago
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...