1477 search results - page 181 / 296 » Random Convex Programs |
ASPDAC
1999
ACM
14 years 1 months ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
LCPC
1994
Springer
14 years 1 months ago
1994
Springer
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
WDAG
1994
Springer
14 years 1 months ago
1994
Springer
This paper investigates how vector time can be used to set breakpoints in distributed computations for the purpose of analyzing and debugging distributed programs. A breakpoint is ...
ASIAN
2006
Springer
14 years 24 days ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
ECRTS
2004
IEEE
14 years 23 days ago
2004
IEEE
In [1], Jejurikar and Gupta investigated energy savings due to optimal slowdown of periodic tasks in real-time task systems, where tasks have varying power characteristics and task...