Sciweavers

492 search results - page 32 / 99
» The number of possibilities for random dating
Sort
View
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
14 years 9 days ago
Compositional, efficient caches for a chip multi-processor
In current multi-media systems major parts of the functionality consist of software tasks executed on a set of concurrently operating processors. Those tasks interfere with each o...
Anca Mariana Molnos, Marc J. M. Heijligers, Sorin ...
ISVLSI
2003
IEEE
118views VLSI» more  ISVLSI 2003»
14 years 1 months ago
Networks-On-Chip: The Quest for On-Chip Fault-Tolerant Communication
In this paper, we discuss the possibility of achieving onchip fault-tolerant communication based on a new communication paradigm called stochastic communication. Specifically, for...
Radu Marculescu
CC
2007
Springer
123views System Software» more  CC 2007»
13 years 8 months ago
An Improved Analysis of Linear Mergers
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
Zeev Dvir, Amir Shpilka
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 20 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ICCAD
2003
IEEE
134views Hardware» more  ICCAD 2003»
14 years 5 months ago
Multi-Domain Clock Skew Scheduling
The application of general clock skew scheduling is practically limited due to the difficulties in implementing a wide spectrum of dedicated clock delays in a reliable manner. Th...
Kaushik Ravindran, Andreas Kuehlmann, Ellen Sentov...