5448 search results - page 317 / 1090 » Breakpoints and Time in Distributed Computations |
191
click to vote
PODC
2006
ACM
16 years 19 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...
149
click to vote
CPHYSICS
2008
15 years 6 months ago
2008
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
168
click to vote
PPOPP
2005
ACM
16 years 7 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...
170
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
183
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...