{"id":"W2807084807","doi":"","title":"Communication Patterns for Randomized Algorithms","year":2018,"lang":"en","type":"dissertation","venue":"Durham e-Theses (Durham University)","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Simon Fraser University; Durham University","keywords":"Computer science; Load balancing (electrical power); Randomized algorithm; Greedy algorithm; Distributed computing; Distributed algorithm; Scheme (mathematics); Algorithm; Theoretical computer science; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007999274,0.001896612,0.001749352,0.001851645,0.002201815,0.005267097,0.002869619,0.003836633,0.01631903],"category_scores_gemma":[0.055806,0.0009535876,0.002075986,0.002457107,0.005650307,0.01062727,0.004836021,0.0074692,0.004155865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003029014,"about_ca_system_score_gemma":0.003209844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001559844,"about_ca_topic_score_gemma":0.00104123,"domain_scores_codex":[0.9883695,0.005308987,0.0006938343,0.002473807,0.002351081,0.00080282],"domain_scores_gemma":[0.9549375,0.03263752,0.00251026,0.006882972,0.002311446,0.0007203157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000850461,0.00006151609,0.0003669107,0.0001830056,0.00004491053,0.00005792421,0.000121168,0.01844736,0.0004511381,0.9425676,0.006752595,0.03086074],"study_design_scores_gemma":[0.00009286915,0.00006540246,0.00009304043,0.00007249494,0.00001741387,0.00007715544,0.00002750613,0.06787408,0.000352841,0.9129432,0.01836223,0.00002173697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00756982,0.003093026,0.9272705,0.008102019,0.001374483,0.0004092659,0.0003833387,0.001127057,0.05067052],"genre_scores_gemma":[0.3391694,0.00673157,0.5869819,0.008886669,0.003839471,0.005377758,0.001318233,0.001531634,0.04616342],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01631903,"threshold_uncertainty_score":0.05459261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01254339870703409,"score_gpt":0.2422599419180428,"score_spread":0.2297165432110087,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}