{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000683796,0.000527893,0.001112614,0.0005418551,0.0005849717,0.0003514246,0.002970613,0.0005069151,0.00006610775],"category_scores_gemma":[0.0001618552,0.0005427228,0.0006519033,0.0006761306,0.0001364569,0.0007785088,0.0002262145,0.000332022,0.00008706082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002094634,"about_ca_system_score_gemma":0.0002472127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003726595,"about_ca_topic_score_gemma":0.0004388454,"domain_scores_codex":[0.9971865,0.000362572,0.0005646639,0.0008939625,0.0004522934,0.0005400492],"domain_scores_gemma":[0.996096,0.000540891,0.0007892998,0.001613015,0.0007755631,0.0001852614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.03640586,0.001827274,0.0002380085,0.003254418,0.003499032,0.0003374259,0.02479433,0.0001162325,0.0004138536,0.7354474,0.04926058,0.1444056],"study_design_scores_gemma":[0.0867338,0.0002962979,0.0004616491,0.001933897,0.0005309071,0.0000272026,0.00411673,0.03058593,0.001425015,0.003930528,0.8674428,0.002515219],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01539652,0.001087167,0.8760887,0.0005505634,0.004132759,0.004997991,0.0008553994,0.001011795,0.09587907],"genre_scores_gemma":[0.5142722,0.0033287,0.07529745,0.0005263115,0.001546596,0.0003655946,0.01354561,0.0003495365,0.390768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8181822,"threshold_uncertainty_score":0.9997025,"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."}}