{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005380577,0.0014717,0.002911944,0.002484443,0.002611726,0.006529795,0.0037963,0.003420061,0.003828499],"category_scores_gemma":[0.04962203,0.00249579,0.002405298,0.003159733,0.003494356,0.005631686,0.003978198,0.002577467,0.0005454588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002035286,"about_ca_system_score_gemma":0.002512068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007126381,"about_ca_topic_score_gemma":0.0009476299,"domain_scores_codex":[0.9943786,0.001834916,0.0004786664,0.0009957008,0.001247922,0.001064166],"domain_scores_gemma":[0.9392808,0.04486195,0.004620148,0.005251177,0.003033519,0.002952372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004394504,0.002073307,0.01635865,0.0008806682,0.0006044968,0.0005226616,0.001357828,0.4919845,0.01626636,0.4009983,0.01200597,0.05255277],"study_design_scores_gemma":[0.000202477,0.0004904979,0.002050038,0.00007300751,0.0000968614,0.0003266129,0.0004604255,0.5890932,0.002980855,0.4028519,0.00132197,0.00005216751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6866948,0.0007830693,0.2940731,0.001788755,0.0001488186,0.000408427,0.001010721,0.0009137733,0.01417857],"genre_scores_gemma":[0.9256913,0.0003042826,0.07005858,0.0003614635,0.0001518361,0.0002549848,0.001006055,0.0002566088,0.001914917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006529795,"threshold_uncertainty_score":0.0284555,"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."}}