Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...
As the scale of modern sensor networks continues to grow, energy consumption, scalability and routing efficiency are becoming key design challenges. Network management plays an im...
We consider an anytime control algorithm for the situation when the processor resource availability is time-varying. The basic idea is to calculate the components of the control i...