4543 search results - page 625 / 909 » Interactive Distributed Configuration |
184
click to vote
SPAA
1998
ACM
15 years 11 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
165
click to vote
CLUSTER
2004
IEEE
15 years 10 months ago
2004
IEEE
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...
217
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this work we present a measurement study of user mobility in Second Life. We first discuss different techniques to collect user traces and then focus on results obtained using ...
174
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
188
click to vote
IANDC
2006
15 years 6 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...