1612 search results - page 117 / 323 » Analysing Randomized Distributed Algorithms |
116
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
155
click to vote
SPAA
1994
ACM
15 years 6 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
117
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We provide a review of independent component analysis (ICA) for complex-valued improper and noncircular random sources. An improper random signal is correlated with its complex co...
116
click to vote
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
123
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...