Sciweavers

384 search results - page 61 / 77
» The Number of Generalized Balanced Lines
Sort
View
PDP
2008
IEEE
15 years 6 months ago
Just-In-Time Scheduling for Loop-based Speculative Parallelization
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
Diego R. Llanos Ferraris, David Orden, Belé...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 1 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
MST
2000
57views more  MST 2000»
14 years 11 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
ITIIS
2010
137views more  ITIIS 2010»
14 years 10 months ago
Improving the Availability of Scalable on-demand Streams by Dynamic Buffering on P2P Networks
In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable cl...
Chow-Sing Lin
TIT
2008
105views more  TIT 2008»
14 years 10 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...