Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
Chris C. N. Chu, Evangeline F. Y. Young, Dennis K....
— Design of Service Level Agreements (SLAs) emerges as an increasingly important discipline in business-oriented IT management. In this work, we study utility maximization of con...
David Breitgand, Elean A. Henis, Onn Shehory, John...
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation m...
Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevi...