Search results

...019}}{{Short description|Description of limiting behavior in probabilistic algorithms}} ...thm for verifying matrix multiplication. It runs faster than deterministic algorithms WHP. ...

...ting Algorithm with an Experimental Study |journal=Journal of Parallel and Distributed Computing |volume=52 |pages=1–23 |doi=10.1006/jpdc.1998.1462 |hdl=1903/835 == Analysis of common parallel algorithms == ...

...e Pesquisa Operacional (SBPO)|doi=10.13140/RG.2.1.1233.8640}}</ref> is a [[distributed algorithm]] in [[graph theory]] for detecting [[cycle (graph theory)|cycles ...m for detecting cycles by message passing is suitable to be implemented in distributed graph ...

...m the stationary distribution of a [[Markov chain]]. Contrary to many MCMC algorithms, coupling from the past gives in principle a perfect sample from the [[stat ...y that for every fixed <math>s\in S</math>, its image <math>f(s)</math> is distributed according to the transition probability of <math>M</math> from state <math> ...

...ing for heterogeneous computing |journal=IEEE Transactions on Parallel and Distributed Systems |volume=13 |issue=3 |pages=260–274 |doi=10.1109/71.993206 |citeseer ...een each pair of workers. It descends from [[list scheduling]] [[Algorithm|algorithms]]. ...

...source model''' checks for [[deadlock (computer science)|deadlock]] in a [[distributed system]]. It was developed by K. Mani Chandy, Jayadev Misra and Laura M Haa ...Cite journal|last2=Misra|first2=J.|last3=Haas|first3=L. M.|year=1983|title=Distributed deadlock detection|journal=ACM Transactions on Computer Systems|volume=1|is ...

...=Amitabh |date=2023-06-01 |title=Termination of amnesiac flooding |journal=Distributed Computing |language=en |volume=36 |issue=2 |pages=193–207 |doi=10.1007/s004 ...m |pages=183–199 |language=en |chapter=Stateless Information Dissemination Algorithms |doi=10.1007/978-3-030-54921-3_11 |editor2-last=Scheideler |editor2-first=C ...

...on Principles of distributed computing |chapter=On scalable and efficient distributed failure detectors |date=August 1, 2001|chapter-url=https://doi.org/10.1145/ [[Category:Distributed algorithms]] ...

==Algorithms== ...ath>.<ref>{{cite journal |last1=Tani |first1=Seiichiro |title=Claw Finding Algorithms Using Quantum Walk |journal=Theoretical Computer Science |volume=410 |issue ...

...ref><ref>{{Cite journal|last=Awerbuch|first=Baruch|year=1987|title=Optimal Distributed Algorithm for Minimum Weight Spanning Tree, Counting, Leader Election and O ...cs.carleton.ca/~santoro/DADA.html|title=Design and Analysis of Distributed Algorithms|last=Santoro|first=Nicola|website=people.scs.carleton.ca|page=213|access-da ...

{{Short description|Theoretical model for parallel algorithms}} {{about|a theoretical model for parallel algorithms|the general concept of computing with many parallel devices|massively paral ...

...tributed]] [[pseudo-random number generator|PRN generator]]. Computational algorithms are then used to manipulate a single [[random variate]], ''X'', or often se One draws a uniformly distributed pseudo-random number ''X'', and searches for the index ''i'' of the corresp ...

A '''version vector''' is a mechanism for tracking changes to data in a [[distributed system]], where multiple agents might update the data at different times. T ...ware Engineering. 1983</ref> or variants are used to track updates in many distributed file systems, such as [[Coda (file system)]] and Ficus, and are the main d ...

...nditional [[probability distribution]] of a [[Poisson distribution|Poisson-distributed]] [[random variable]], given that the value of the random variable is not z == Generating zero-truncated Poisson-distributed random variables == ...

...ltiport Message-Passing Systems|journal= IEEE Transactions on Parallel and Distributed Systems|volume=8|issue=11|pages=1143–1156|doi=10.1109/71.642949|url=https:/ ...ication pattern)|hypercube]], [[Ring network|ring]]), different all-to-all algorithms are required. ...

...2=Joerg|last3=Santos|first3=Francisco|title=Triangulations: Structures for Algorithms and Applications|url=https://archive.org/details/triangulationsst00loer |ur ...f neighbors, and the [[internal angle]]s of the triangulation are unevenly distributed. ...

...ateral [[symmetry breaking]] of an ensemble of symmetric vectors regularly distributed in a square lattice. Usually, the lattice of vectors represent the first-or ...g the sets of local norms and phases as discrete compact groups, spatially distributed in a square lattice, the gradient moments have the basic property of being ...

...[graph algorithm]]s and [[parameterized complexity]] and in particular for algorithms relating to [[tree decomposition]] of graphs. ...ate in 1986 under the supervision of [[Jan van Leeuwen]] with the thesis ''Distributed Computing – Structure and Complexity.''<ref name="cv"/><ref>{{mathgenealogy ...

...of <math>k</math> [[random variable]]s, <math>X_1,\ldots,X_k</math>, each distributed over <math>\{0,1\}^n</math> at least one of which is uniformly random; but The job of the merger is to output a new random variable, also distributed over <math>\{0,1\}^n</math>, that retains as much of that entropy as possib ...

...100 random variables <math>X_1, X_2,..., X_{100}</math> are all uniformly distributed on <math>[0, 1]</math>, not necessarily independent, and let <math>s= 10</m ...gative random variables (possibly dependent) that are jointly continuously distributed. For <math>n \in \{1, 2,... \}</math> and <math>s\in \mathbb{R}^+</math> le ...