Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Multi-trials_technique> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items 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 wikiPageRevisionID "532925234".
- Multi-trials_technique hasPhotoCollection Multi-trials_technique.
- 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 Abstraction100002137.
- Multi-trials_technique type Attribute100024264.
- Multi-trials_technique type ComputationalProblemsInGraphTheory.
- Multi-trials_technique type Condition113920835.
- Multi-trials_technique type Difficulty114408086.
- Multi-trials_technique type NP-completeProblems.
- Multi-trials_technique type Problem114410605.
- Multi-trials_technique type State100024720.
- 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 sameAs Multi-trials_technique.
- Multi-trials_technique wasDerivedFrom Multi-trials_technique?oldid=532925234.
- Multi-trials_technique isPrimaryTopicOf Multi-trials_technique.