Sciweavers

4313 search results - page 604 / 863
» Using time travel to diagnose computer problems
Sort
View
APPROX
2006
Springer
88views Algorithms» more  APPROX 2006»
15 years 11 months ago
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
Leah Epstein, Magnús M. Halldórsson,...
TC
2011
15 years 2 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
189
Voted
CF
2004
ACM
16 years 26 days ago
A first glance at Kilo-instruction based multiprocessors
The ever increasing gap between processor and memory speed, sometimes referred to as the Memory Wall problem [42], has a very negative impact on performance. This mismatch will be...
Marco Galluzzi, Valentin Puente, Adrián Cri...
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 11 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
WAN
1998
Springer
15 years 11 months ago
The NRW Metacomputing Initiative
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...
Uwe Schwiegelshohn, Ramin Yahyapour