Suchergebnisse - "Mathematics of computing Mathematical analysis Mathematical optimization"

Precimonious: tuning assistant for floating-point precision von Rubio-González, Cindy, Nguyen, Cuong, Nguyen, Hong Diep, Demmel, James, Kahan, William, Sen, Koushik, Bailey, David H., Iancu, Costin, Hough, David

“… Precimonious performs a search on the types of the floating-point program variables trying to lower their precision subject to accuracy constraints and performance goals …”
Volltext

An optimal analytical solution for processor speed control with thermal constraints von Rao, Ravishankar, Vrudhula, Sarma, Chakrabarti, Chaitali, Chang, Naehyuck

“… We formulate the problem of maximizing the average throughput of a processor over a given time period, subject to thermal and speed constraints, as a problem …”
Volltext

Fast power/ground network optimization based on equivalent circuit modeling von Tan, X.-D. Sheldon, Shi, C.-J. Richard

“… This paper presents an efficient algorithm for optimizing the area of power or ground networks in integrated circuits subject to the reliability constraints …”
Volltext

Post-routing redundant via insertion and line end extension with via density consideration von Lee, Kuang-Yao, Wang, Ting-Chi, Chao, Kai-Yuan

“… Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended techniques to reduce yield loss due …”
Volltext

Maximum entropy light source placement von Gumhold, Stefan

“… Finding the "best" viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the …”
Volltext

Optimal wire sizing and buffer insertion for low power and a generalized delay model von Lillis, John, Cheng, Chung-Kuan, Lin, Ting-Ting Y.

“… Our algorithms are able to minimize dynamic power dissipation subject to given timing constraints …”
Volltext

Linear decomposition algorithm for VLSI design applications von Li, Jianmin, Lillis, John, Cheng, Chung-Kuan

“… In our unified approach, the max-flow min-cut provides an optimal ordered partition subject to the given seeds and the eigenvector placement provides heuristic information for seed selection …”
Volltext