4616 search results - page 338 / 924 » The Communication Complexity of Correlation |
198
click to vote
CONIELECOMP
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we present a set of formulations that describe some properties of the configurations that can represent the n-Dimensional Orthogonal PseudoPolytopes. Moreover, we de...
175
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper examines the asymptotic behavior of solutions of a simple network model using feedback control under the presence of delays. It shows numerically the existence of compl...
168
click to vote
TJS
2008
15 years 6 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
171
click to vote
MAGS
2007
15 years 6 months ago
2007
Large-scale individual-based simulations can benefit a lot from high performance computing environments. The benefit that can be hopped depends greatly on a good load distributi...
192
click to vote
ITA
2002
15 years 6 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...