{"id":"W2550177187","doi":"10.1080/18756891.2016.1256577","title":"A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Hebei GEO University; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Harmony search; Cuckoo search; Knapsack problem; Computer science; Continuous knapsack problem; Algorithm; Artificial intelligence; Mathematical optimization; Machine learning; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002108107,0.0002876794,0.0004264375,0.0005580511,0.0001347894,0.0007510579,0.002903749,0.00007249667,0.00005204295],"category_scores_gemma":[0.0002647545,0.0001920883,0.0002029383,0.0005802988,0.0002195812,0.00122137,0.0002848789,0.0002430676,0.0000802034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006370053,"about_ca_system_score_gemma":0.001242894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006525715,"about_ca_topic_score_gemma":0.000001827472,"domain_scores_codex":[0.9940563,0.0002105003,0.001290132,0.0005173184,0.003415814,0.0005098835],"domain_scores_gemma":[0.9881957,0.001267116,0.000581139,0.0003127476,0.009282572,0.0003607071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001450197,0.000343257,0.0002383482,0.0000431791,0.0005510333,0.0001096871,0.0001978062,0.6681398,0.0001766155,0.06002434,0.001065979,0.2689649],"study_design_scores_gemma":[0.001229332,0.0005707444,0.0001773191,0.0004088463,0.00001276494,0.002968714,0.00007948704,0.9848297,0.001598628,0.005376942,0.002458196,0.0002892945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003736465,0.0002003649,0.9923658,0.004086171,0.00182036,0.0006329477,0.0002644882,0.00005014172,0.0002060387],"genre_scores_gemma":[0.2313659,0.00007186305,0.7670333,0.0001445858,0.0008183498,0.00004586452,0.00002124388,0.00003095725,0.0004678781],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3166899,"threshold_uncertainty_score":0.7833132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05379947559308494,"score_gpt":0.3403491801626603,"score_spread":0.2865497045695753,"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."}}