Sciweavers

622 search results - page 103 / 125
» Stochastic programming approach to optimization under uncert...
Sort
View
IPCO
2008
221views Optimization» more  IPCO 2008»
15 years 3 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 6 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
15 years 7 months ago
Opportunities and challenges for better than worst-case design
The progressive trend of fabrication technologies towards the nanometer regime has created a number of new physical design challenges for computer architects. Design complexity, u...
Todd M. Austin, Valeria Bertacco, David Blaauw, Tr...
ICAC
2008
IEEE
15 years 8 months ago
Power and Performance Management of Virtualized Computing Environments Via Lookahead Control
— There is growing incentive to reduce the power consumed by large-scale data centers that host online services such as banking, retail commerce, and gaming. Virtualization is a ...
Dara Kusic, Jeffrey O. Kephart, James E. Hanson, N...
CCE
2004
15 years 1 months ago
Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
Dan Wu, Marianthi G. Ierapetritou