{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002721097,0.0001512705,0.00009551639,0.0003170897,0.001296836,0.0004638763,0.001767093,0.00008111686,0.000006561342],"category_scores_gemma":[0.000004533885,0.0001155166,0.00006507137,0.001528778,0.0001734544,0.0001384168,0.0002730933,0.0004949539,0.0009085052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001649017,"about_ca_system_score_gemma":0.0001260147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001224731,"about_ca_topic_score_gemma":0.00001724959,"domain_scores_codex":[0.997641,0.0001643694,0.0003557383,0.0005925836,0.0006015593,0.000644789],"domain_scores_gemma":[0.997394,0.0009992059,0.00007552753,0.0009493803,0.000415411,0.0001664733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001687593,0.0003659246,0.00001370356,0.0000127767,0.000007862269,0.000001629011,0.0002929946,0.03484871,0.0005305273,0.369885,0.01017823,0.5838457],"study_design_scores_gemma":[0.0001696679,0.000204316,0.000168098,0.00003148848,0.000001218774,0.000003431375,0.00002395598,0.3437359,0.01068048,0.0108956,0.6338966,0.0001892388],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005126379,0.00003280363,0.9800274,0.007085532,0.00003326445,0.001310608,0.000001871928,0.0002123949,0.0112449],"genre_scores_gemma":[0.1118284,0.00005456956,0.8830909,0.002546448,0.0002723719,0.0008412707,0.00002182201,0.00003195324,0.001312257],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6237184,"threshold_uncertainty_score":0.9998694,"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."}}