{"id":"W2067326981","doi":"10.5555/545381.545481","title":"Incremental) priority algorithms","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Greedy algorithm; Computer science; Simplicity; Greedy randomized adaptive search procedure; Mathematical optimization; Algorithm; Scheduling (production processes); Limit (mathematics); Approximation algorithm; Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.003341125,0.001132165,0.001098929,0.001013137,0.001028525,0.002841404,0.004435976,0.001654396,0.0111122],"category_scores_gemma":[0.01597309,0.0005416385,0.0009949531,0.001633093,0.0009509447,0.005333751,0.002587713,0.00251824,0.003582384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512796,"about_ca_system_score_gemma":0.002139747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001752982,"about_ca_topic_score_gemma":0.002609613,"domain_scores_codex":[0.9974027,0.000656658,0.0001347944,0.0005411681,0.0007397875,0.0005247726],"domain_scores_gemma":[0.9945878,0.002722074,0.0004090184,0.001229257,0.0006507271,0.0004011109],"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.0006270834,0.0004860408,0.00203159,0.0005485067,0.0001199957,0.0001545201,0.0003082831,0.1188697,0.003737807,0.4751806,0.03220524,0.3657307],"study_design_scores_gemma":[0.0001762778,0.0002925122,0.0003690152,0.00005856031,0.00008468612,0.000299553,0.000117021,0.4936308,0.002955993,0.4769064,0.02507633,0.00003301354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01280822,0.0009446715,0.9618294,0.0009800198,0.0003811589,0.0001989054,0.0002210574,0.001340758,0.02129584],"genre_scores_gemma":[0.352075,0.001484315,0.6262023,0.001135044,0.0006373653,0.0004487362,0.0007456592,0.0004795778,0.01679189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0111122,"threshold_uncertainty_score":0.03717405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02435609350982374,"score_gpt":0.2632225026411814,"score_spread":0.2388664091313576,"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."}}