Sciweavers

2715 search results - page 283 / 543
» Total Generalized Variation
Sort
View
150
Voted
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 9 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
IWMM
2004
Springer
98views Hardware» more  IWMM 2004»
15 years 9 months ago
Dynamic object sampling for pretenuring
Many state-of-the-art garbage collectors are generational, collecting the young nursery objects more frequently than old objects. These collectors perform well because young objec...
Maria Jump, Stephen M. Blackburn, Kathryn S. McKin...
ICPP
2002
IEEE
15 years 9 months ago
A Selection Technique for Replicated Multicast Video Servers
Abstract— In this paper, we propose a selection technique for replicated multicast video streams from different servers. We assume that there exist replicated video servers, each...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
CF
2009
ACM
15 years 8 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
139
Voted
ISTCS
1997
Springer
15 years 8 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel