{"id":"W2092935629","doi":"10.1080/10637199808947384","title":"RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES","year":2000,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Ranking (information retrieval); Computation; Parallel algorithm; Cost efficiency; Parallel computing; Randomized algorithm; Theoretical computer science; Algorithm; Information retrieval","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446159,0.0006727694,0.001084268,0.0007617823,0.00106476,0.001399372,0.001718527,0.0007629625,0.003767919],"category_scores_gemma":[0.005023861,0.0004833218,0.0005115141,0.001226662,0.001011048,0.0022319,0.001215072,0.000956058,0.001187718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001646057,"about_ca_system_score_gemma":0.002883815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004627209,"about_ca_topic_score_gemma":0.009644185,"domain_scores_codex":[0.9981248,0.0007093826,0.00009184708,0.0002633078,0.0005133872,0.0002972326],"domain_scores_gemma":[0.9975077,0.00116986,0.0002236271,0.0005343901,0.0004307397,0.0001336606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007132777,0.000286217,0.0008594943,0.0001973336,0.00003880412,0.0001047356,0.0001039298,0.7085142,0.01426472,0.05827237,0.01081857,0.2058263],"study_design_scores_gemma":[0.00009794072,0.00007784447,0.0001042904,0.000004277035,0.000008010956,0.00001513177,0.00001805238,0.9731628,0.003195139,0.02242016,0.0008839827,0.000012352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05514076,0.000293518,0.9358544,0.000580763,0.00006636478,0.0001629538,0.0001454557,0.003734381,0.004021307],"genre_scores_gemma":[0.4055886,0.000203379,0.5876179,0.0002298282,0.00007342407,0.0002909861,0.0005288048,0.000396161,0.005070914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004627209,"threshold_uncertainty_score":0.01260489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01786713948870236,"score_gpt":0.275782526090011,"score_spread":0.2579153866013086,"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."}}