{"id":"W2096572719","doi":"10.1109/ladc.2009.16","title":"Adaptive Sabotage-Tolerant Scheduling for Peer-to-Peer Grids","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Correctness; Computation; Heuristics; Grid computing; Grid; Peer-to-peer; Mathematical optimization; Algorithm; Operating system","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297805,0.0001907898,0.0002475193,0.00008910239,0.0001889352,0.0003262835,0.0009541739,0.00007251945,0.000007986691],"category_scores_gemma":[0.0001032183,0.0001633279,0.0001238751,0.0004030955,0.00001128291,0.0002297536,0.00009718321,0.0001127264,0.000150202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004200116,"about_ca_system_score_gemma":0.00007167508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002340135,"about_ca_topic_score_gemma":0.000003230007,"domain_scores_codex":[0.9981676,0.00003932471,0.0003005505,0.0005006525,0.0005164024,0.0004754231],"domain_scores_gemma":[0.9986067,0.0001132519,0.00006793761,0.0004843125,0.000529811,0.0001979482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007174407,0.0002911131,0.00013992,0.00002795474,0.00007495053,0.00003278221,0.003142789,0.1155665,0.0009060584,0.6589483,0.1164923,0.1043055],"study_design_scores_gemma":[0.0007397747,0.0006502055,0.001147005,0.00007514571,0.000007609045,0.00002413667,0.0001143817,0.8658059,0.0006663611,0.005006102,0.1252545,0.0005088136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005501968,0.00004386405,0.9742324,0.00889774,0.000766701,0.0003903274,0.00001181728,0.0004061262,0.009749091],"genre_scores_gemma":[0.7703103,2.410937e-7,0.2228787,0.001435234,0.0002727995,0.00001178653,0.000009319077,0.00000648256,0.005075139],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7648084,"threshold_uncertainty_score":0.6660317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0283622392393071,"score_gpt":0.2819546298656306,"score_spread":0.2535923906263235,"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."}}