Sciweavers

975 search results - page 8 / 195
» Locality Optimization for Program Instances
Sort
View
ISQED
2006
IEEE
118views Hardware» more  ISQED 2006»
15 years 3 months ago
Localized On-Chip Power Delivery Network Optimization via Sequence of Linear Programming
— In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linea...
Jeffrey Fan, I-Fan Liao, Sheldon X.-D. Tan, Yici C...
SPAA
2009
ACM
15 years 10 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
CVPR
2009
IEEE
16 years 4 months ago
A Min-Max Framework of Cascaded Classifier with Multiple Instance Learning for Computer Aided Diagnosis
The computer aided diagnosis (CAD) problems of detecting potentially diseased structures from medical images are typically distinguished by the following challenging characterist...
Dijia Wu (Rensselaer Polytechnic Institute), Jinbo...
MP
2002
95views more  MP 2002»
14 years 9 months ago
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem....
Giovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeging...
CF
2010
ACM
15 years 2 months ago
Exposing parallelism and locality in a runtime parallel optimization framework
Runtime parallel optimization has been suggested as a means to overcome the difficulties of parallel programming. For runtime parallel optimization to be effective, parallelism a...
David A. Penry, Daniel J. Richins, Tyler S. Harris...