{"id":"W2120954276","doi":"10.1016/j.tcs.2010.03.014","title":"Randomized priority algorithms","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Randomized algorithm; Job shop scheduling; Class (philosophy); Approximation algorithm; Computer science; Scheduling (production processes); Algorithm; Context (archaeology); Deterministic algorithm; Mathematical optimization; Mathematics; Schedule; Artificial intelligence","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.005088758,0.000154826,0.0002923235,0.0001901687,0.0004550164,0.0008011068,0.002995315,0.00006264178,0.0001482031],"category_scores_gemma":[0.0003975756,0.0001135495,0.00009815667,0.001146771,0.005248009,0.0008621216,0.001127353,0.0004428656,0.0001691323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000175539,"about_ca_system_score_gemma":0.0002068981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002915215,"about_ca_topic_score_gemma":5.555229e-7,"domain_scores_codex":[0.9974248,0.0001944275,0.000297812,0.0006582314,0.000851386,0.0005733572],"domain_scores_gemma":[0.9978036,0.0004488025,0.00006079729,0.0009322286,0.0003345111,0.0004201014],"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.00008075407,0.00003871254,0.000004657416,0.000001862454,0.000002114128,0.000003827153,0.0002383207,0.00006255174,0.0004837177,0.9726874,0.00002481563,0.02637129],"study_design_scores_gemma":[0.008871719,0.00003327484,0.00003302364,0.000003607202,0.000001610616,0.00002211399,7.264188e-7,0.780111,0.001253579,0.2093351,0.0001935876,0.0001406546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005028088,0.000005190825,0.9793693,0.002569248,0.001364573,0.0003294052,4.444442e-7,0.0003329505,0.01100074],"genre_scores_gemma":[0.5409505,0.000003349431,0.4584257,0.0004853396,0.0000985989,0.000008974416,2.910572e-7,0.000003869363,0.00002327182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7800484,"threshold_uncertainty_score":0.9974591,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01063567837893452,"score_gpt":0.2768811115611415,"score_spread":0.2662454331822069,"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."}}