Sciweavers

1792 search results - page 80 / 359
» Improved scheduling in rings
Sort
View
FOCS
2007
IEEE
14 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ISCA
2000
IEEE
121views Hardware» more  ISCA 2000»
14 years 2 months ago
Memory access scheduling
The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the “3-D” structure of banks, rows, and columns characteristi...
Scott Rixner, William J. Dally, Ujval J. Kapasi, P...
DAM
2007
91views more  DAM 2007»
13 years 10 months ago
A note on the precedence-constrained class sequencing problem
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
José R. Correa, Samuel Fiorini, Nicol&aacut...
ISCC
2006
IEEE
14 years 4 months ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
INFOCOM
2009
IEEE
14 years 4 months ago
On the Exploitation of CDF Based Wireless Scheduling
—Channel-aware scheduling strategies - such as the CDF Scheduler (CS) algorithm for the CDMA/HDR systems provide an effective mechanism for utilizing the channel data rate for im...
Udi Ben-Porat, Anat Bremler-Barr, Hanoch Levy