Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Multi-trials_technique> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Multi-trials_technique abstract "The multi-trials technique by Schneider et al. is employed for distributed algorithms and allows to break symmetry efficiently. Symmetry breaking is necessary, for instance, in resource allocation problems, where many entities want to access the same resource concurrently. Many message passing algorithms typically employ one attempt to break symmetry per message exchange. The multi-trials technique transcends this approach through employing more attempts with every message exchange.For example, in a simple algorithm for computing an O(Δ) vertex coloring, where Δ denotes the maximum degree in the graph, every uncolored node randomly picks an available color and keeps it if no neighbor (concurrently) chooses the same color. For the multi-trials technique, a node gradually increases the number of chosen colors in every communication round. The technique can yield more than an exponential reduction in the required communication rounds. However, if the maximum degree Δ is small more efficient techniques exist, e.g. the (extended) coin-tossing technique by Richard Cole and Uzi Vishkin.".
- Multi-trials_technique wikiPageExternalLink podc08SW.pdf.
- Multi-trials_technique wikiPageExternalLink podcfp107_schneider_188.pdf.
- Multi-trials_technique wikiPageID "29722894".
- Multi-trials_technique wikiPageLength "1986".
- Multi-trials_technique wikiPageOutDegree "10".
- Multi-trials_technique wikiPageRevisionID "639098856".
- Multi-trials_technique wikiPageWikiLink Category:Computational_problems_in_graph_theory.
- Multi-trials_technique wikiPageWikiLink Category:Graph_coloring.
- Multi-trials_technique wikiPageWikiLink Category:Graph_theory.
- Multi-trials_technique wikiPageWikiLink Category:NP-complete_problems.
- Multi-trials_technique wikiPageWikiLink Distributed_algorithm.
- Multi-trials_technique wikiPageWikiLink Distributed_algorithms.
- Multi-trials_technique wikiPageWikiLink Graph_coloring.
- Multi-trials_technique wikiPageWikiLink Message_passing.
- Multi-trials_technique wikiPageWikiLink Symposium_on_Principles_of_Distributed_Computing.
- Multi-trials_technique wikiPageWikiLink Uzi_Vishkin.
- Multi-trials_technique wikiPageWikiLink Vertex_coloring.
- Multi-trials_technique wikiPageWikiLinkText "Multi-trials technique".
- Multi-trials_technique wikiPageWikiLinkText "multi-trials technique".
- Multi-trials_technique hasPhotoCollection Multi-trials_technique.
- Multi-trials_technique wikiPageUsesTemplate Template:Citation.
- Multi-trials_technique wikiPageUsesTemplate Template:Reflist.
- Multi-trials_technique subject Category:Computational_problems_in_graph_theory.
- Multi-trials_technique subject Category:Graph_coloring.
- Multi-trials_technique subject Category:Graph_theory.
- Multi-trials_technique subject Category:NP-complete_problems.
- Multi-trials_technique type Combinatoric.
- Multi-trials_technique type Field.
- Multi-trials_technique type Relation.
- Multi-trials_technique comment "The multi-trials technique by Schneider et al. is employed for distributed algorithms and allows to break symmetry efficiently. Symmetry breaking is necessary, for instance, in resource allocation problems, where many entities want to access the same resource concurrently. Many message passing algorithms typically employ one attempt to break symmetry per message exchange.".
- Multi-trials_technique label "Multi-trials technique".
- Multi-trials_technique sameAs m.0fp_jtm.
- Multi-trials_technique sameAs Q6934515.
- Multi-trials_technique sameAs Q6934515.
- Multi-trials_technique wasDerivedFrom Multi-trials_technique?oldid=639098856.
- Multi-trials_technique isPrimaryTopicOf Multi-trials_technique.