Sciweavers

8431 search results - page 1281 / 1687
» Algorithmically Independent Sequences
Sort
View
GLVLSI
2003
IEEE
132views VLSI» more  GLVLSI 2003»
16 years 1 days ago
A highly regular multi-phase reseeding technique for scan-based BIST
In this paper a novel reseeding architecture for scan-based BIST, which uses an LFSR as TPG, is proposed. Multiple cells of the LFSR are utilized as sources for feeding the scan c...
Emmanouil Kalligeros, Xrysovalantis Kavousianos, D...
INFOCOM
2003
IEEE
16 years 1 days ago
Asymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
Abstract— We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility...
Predrag R. Jelenkovic, Ana Radovanovic
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
16 years 13 hour ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
16 years 12 hour ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
SPAA
2003
ACM
16 years 12 hour ago
The load rebalancing problem
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
Gagan Aggarwal, Rajeev Motwani, An Zhu
« Prev « First page 1281 / 1687 Last » Next »