Výsledky vyhledávání - "parallel randomized algorithm"

A sublinear-time randomized approximation algorithm for matrix games

Autoři: Michael D. Grigoriadis Leonid Khachiyan

Zdroj: Operations Research Letters. 18:53-58

Témata: \((m, n)\)-matrix game, Linear programming, 0211 other engineering and technologies, parallel randomized algorithm, Parallel numerical computation, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, approximation algorithms, \(\varepsilon\)-optimal strategies, 01 natural sciences, 2-person games

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/912512
https://doi.org/10.1016/0167-6377(95)00032-0

A randomized parallel algorithm for planar graph isomorphism

Autoři: Hillel Gazit John H. Reif

Zdroj: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures - SPAA '90. :210-219

Témata: Graph theory (including graph drawing) in computer science, parallel randomized algorithm, 0102 computer and information sciences, Parallel algorithms in computer science, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1206662
https://doi.org/10.1006/jagm.1998.0943
https://dl.acm.org/doi/10.1145/97444.97687
https://dblp.uni-trier.de/db/conf/spaa/spaa90.html#GazitR90
https://dblp.uni-trier.de/db/journals/jal/jal28.html#GazitR98
https://www.sciencedirect.com/science/article/pii/S0196677498909439

A fast and simple randomized parallel algorithm for the maximal independent set problem

Autoři: Noga Alon Alon Itai László Babai

Zdroj: Journal of Algorithms. 7:567-583

Témata: expected running time, Analysis of algorithms and problem complexity, Randomized algorithms, concurrent-read concurrent-write PRAM, exclusive- read exclusive-write PRAM, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph theory (including graph drawing) in computer science, Graph algorithms (graph-theoretic aspects), 0202 electrical engineering, electronic engineering, information engineering, parallel randomized algorithm, Parallel algorithms in computer science, maximal independent set in a graph

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4026849
https://doi.org/10.1016/0196-6774(86)90019-2

A fast and simple randomized parallel algorithm for maximal matching

Autoři: Alon Itai Amos Israel

Zdroj: Information Processing Letters. 22:77-80

Témata: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, parallel randomized algorithm, 0102 computer and information sciences, 02 engineering and technology, parallel computation, CRCW-PRAM, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://www.sciencedirect.com/science/article/pii/0020019086901444
https://www.sciencedirect.com/science/article/abs/pii/0020019086901444
https://dblp.uni-trier.de/db/journals/ipl/ipl22.html#IsraelI86
https://dl.acm.org/doi/10.1016/0020-0190%2886%2990144-4

An optimal randomized parallel algorithm for finding connected components in a graph

Autoři: Hillel Gazit

Zdroj: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). :492-501

Témata: Connectivity, connected components, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), parallel randomized algorithm, 0102 computer and information sciences, Paths and cycles, CRCW, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/27803
https://doi.org/10.1137/0220066
https://ieeexplore.ieee.org/document/4568240/
http://ieeexplore.ieee.org/document/4568240/
https://dblp.uni-trier.de/db/conf/focs/focs86.html#Gazit86
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004568240
https://doi.org/10.1109/SFCS.1986.9
https://epubs.siam.org/doi/abs/10.1137/0220066
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp20.html#Gazit91

Simple dynamics for Plurality Consensus

Autoři: BECCHETTI, Luca NATALE, EMANUELE PASQUALE, FRANCESCO a další

Přispěvatelé: BECCHETTI, Luca NATALE, EMANUELE PASQUALE, FRANCESCO a další

Témata: general markov chain, markov chain, parallel randomized algorithm, plurality consensus

Popis souboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/9781450328210; ispartofbook:SPAA '14 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures; 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014; firstpage:247; lastpage:256; numberofpages:10; http://hdl.handle.net/11573/610617; http://dl.acm.org/citation.cfm?doid=2612669.2612677

Dostupnost: http://hdl.handle.net/11573/610617
https://doi.org/10.1145/2612669.2612677
http://dl.acm.org/citation.cfm?doid=2612669.2612677