{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006538998,0.002050873,0.003141533,0.002368483,0.003138416,0.005822209,0.006094814,0.003259152,0.03683963],"category_scores_gemma":[0.03058507,0.001426276,0.002039985,0.00380994,0.002782044,0.009174346,0.004630889,0.007220804,0.00956607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004068598,"about_ca_system_score_gemma":0.007472386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231254,"about_ca_topic_score_gemma":0.003513271,"domain_scores_codex":[0.9915194,0.003074379,0.0003451479,0.001655264,0.002080567,0.001325289],"domain_scores_gemma":[0.9822363,0.008521868,0.000709632,0.005435106,0.001754953,0.001342191],"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.002111713,0.0008437459,0.0008088925,0.0005056154,0.0001368465,0.00007168558,0.0001939705,0.03721284,0.002214712,0.6561523,0.08082497,0.2189227],"study_design_scores_gemma":[0.0008506495,0.0003170614,0.0002671978,0.00007732092,0.0001234829,0.0001570098,0.00006634304,0.2188505,0.002395496,0.7470512,0.02979218,0.00005161384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01583086,0.002623113,0.9189059,0.004693432,0.002070709,0.0004357008,0.0006908613,0.003621846,0.05112754],"genre_scores_gemma":[0.3630393,0.002325974,0.5527101,0.003399654,0.00311525,0.001041772,0.002148404,0.002277858,0.06994177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03683963,"threshold_uncertainty_score":0.1232408,"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."}}