5149 search results - page 470 / 1030 » Timed Asynchronous Distributed Systems |
163
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
185
click to vote
PODC
2006
ACM
16 years 15 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
196
Voted
APSEC
2002
IEEE
15 years 11 months ago
2002
IEEE
We have taught several distributed software engineering project courses with students and real clients [4]. During these projects, students in Pittsburgh and Munich, Germany colla...
196
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
165
click to vote
IEEEPACT
2008
IEEE
16 years 29 days ago
2008
IEEE
This paper presents the Distributed Cooperative Caching, a scalable and energy-efficient scheme to manage chip multiprocessor (CMP) cache resources. The proposed configuration is...