{"id":"W2382551251","doi":"","title":"The Research on Swarm Intelligence Based on 0/1 Knapsack Problem Solution","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Swarm intelligence; Computer science; Mathematical optimization; Cutting stock problem; Particle swarm optimization; Robustness (evolution); Polynomial-time approximation scheme; Generalized assignment problem; Ant colony optimization algorithms; Combinatorial optimization; Swarm behaviour; Convergence (economics); Optimization problem; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246631,0.0007862021,0.0008194821,0.0008695347,0.0006639622,0.001514241,0.0008758695,0.001192949,0.001823277],"category_scores_gemma":[0.002397136,0.0003965177,0.0008966723,0.00159954,0.00141212,0.002722235,0.0007352617,0.001539191,0.0004491133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007283218,"about_ca_system_score_gemma":0.0008476432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001843411,"about_ca_topic_score_gemma":0.000825208,"domain_scores_codex":[0.9991518,0.0002866003,0.00006328146,0.0001553155,0.00028918,0.00005384285],"domain_scores_gemma":[0.9992003,0.0004692579,0.00006556245,0.00006260782,0.0001760408,0.00002631079],"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.00006777485,0.00008422273,0.001427262,0.001496816,0.0001411854,0.0002610794,0.0003205599,0.172363,0.007417148,0.501931,0.006238177,0.3082519],"study_design_scores_gemma":[0.00003343434,0.0002355302,0.001240214,0.0003316934,0.00007560746,0.0004343479,0.0002033454,0.6316168,0.00759515,0.2893334,0.06882279,0.00007764099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01327061,0.0150863,0.9367219,0.001446589,0.0007175485,0.00009304031,0.0000498592,0.0001698649,0.03244422],"genre_scores_gemma":[0.3774609,0.04421925,0.5566587,0.0007561598,0.001518579,0.0002961118,0.0002936512,0.0000975298,0.01869911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001843411,"threshold_uncertainty_score":0.00659287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0695622077182088,"score_gpt":0.3686154180933716,"score_spread":0.2990532103751628,"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."}}