{"id":"W1992712376","doi":"10.1007/s10951-009-0148-2","title":"Characterizing sets of jobs that admit optimal greedy-like algorithms","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Greedy algorithm; Computation; Algorithm; Set (abstract data type); Computer science; Mathematics; Combinatorics; Class (philosophy); Mathematical optimization; Discrete mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0008809675,0.0001166696,0.0002761816,0.000251082,0.00009202035,0.0001586851,0.0007191678,0.00006435839,0.00002559458],"category_scores_gemma":[0.00006277209,0.00009957181,0.0001415208,0.0003121554,0.00002670922,0.001263783,0.00008462779,0.000335087,0.000006561942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425162,"about_ca_system_score_gemma":0.0001389022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001680363,"about_ca_topic_score_gemma":1.632742e-7,"domain_scores_codex":[0.9984637,0.00006112556,0.000515429,0.0001459149,0.0005574233,0.000256444],"domain_scores_gemma":[0.998657,0.00005165284,0.0005592727,0.0002036789,0.0003412928,0.0001870387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000206379,0.001077948,0.006408222,0.0001648894,0.0003343995,0.0006378702,0.01292733,0.2363084,0.1327969,0.01015839,0.000583165,0.5983961],"study_design_scores_gemma":[0.001780541,0.001101354,0.01530601,0.0005564603,0.00002626209,0.0006422831,0.0003371902,0.9584588,0.01892547,0.0009468488,0.001516498,0.0004022484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2180816,0.0003790734,0.7769818,0.003503704,0.0005447989,0.00009011066,0.000001150517,0.00003344523,0.0003843326],"genre_scores_gemma":[0.5516784,0.0001183818,0.4476479,0.0004190738,0.00009556652,2.5934e-7,4.696251e-7,0.000005187305,0.00003478998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7221504,"threshold_uncertainty_score":0.4060421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0401982384900589,"score_gpt":0.2923654948928361,"score_spread":0.2521672564027773,"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."}}