2924 search results - page 341 / 585 » Lower Bounds in Distributed Computing |
126
click to vote
JSSPP
2001
Springer
15 years 9 months ago
2001
Springer
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
140
click to vote
QEST
2008
IEEE
15 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
152
click to vote
ENTCS
2008
15 years 4 months ago
2008
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
170
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
170
click to vote
MOBIHOC
2004
ACM
15 years 10 months ago
2004
ACM
In third generation (3G) wireless data networks, repeated requests for popular data items can exacerbate the already scarce wireless spectrum. In this paper we propose an architec...