{"id":"W1554277184","doi":"10.1007/978-3-540-73545-8_49","title":"Priority Algorithms for the Subset-Sum Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Key (lock); Greedy algorithm; Algorithm; Approximation algorithm; Power (physics); Simple (philosophy); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics","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.003198492,0.00142901,0.002372819,0.001422821,0.002068028,0.004327479,0.004393613,0.001640135,0.01317858],"category_scores_gemma":[0.01060191,0.0008789967,0.001450712,0.003067195,0.001314422,0.008238085,0.003191188,0.005123853,0.003379766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002262057,"about_ca_system_score_gemma":0.002389281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001454489,"about_ca_topic_score_gemma":0.002043864,"domain_scores_codex":[0.9979796,0.0005446852,0.0001321037,0.0003332107,0.0006746452,0.0003357852],"domain_scores_gemma":[0.9939434,0.003541645,0.0002785406,0.001175004,0.0006294484,0.0004320256],"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.0007364012,0.0004345312,0.0003623565,0.0005436218,0.00007388122,0.00004646256,0.0003185956,0.0342773,0.002766188,0.6296897,0.03010331,0.3006476],"study_design_scores_gemma":[0.0002143398,0.0001332104,0.0001364667,0.00004470739,0.00005393512,0.0001136805,0.0000899746,0.1429674,0.001820376,0.8434103,0.01098655,0.00002896887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01463307,0.001664768,0.9610617,0.00127621,0.000594766,0.0001968688,0.0002343537,0.001250364,0.01908785],"genre_scores_gemma":[0.2360728,0.003108773,0.7284222,0.00077894,0.00150887,0.0005146324,0.001050018,0.0009777996,0.027566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01317858,"threshold_uncertainty_score":0.04408675,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04608305401403921,"score_gpt":0.287027869965869,"score_spread":0.2409448159518298,"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."}}