{"id":"W2012131995","doi":"10.1109/nabic.2009.5393729","title":"Multi-colony parallel ant colony optimization on SMP and multi-core computers","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Metaheuristic; Parallel computing; Node (physics); Parallel metaheuristic; Core (optical fiber); Multi-core processor; Ant colony; Distributed computing; Shared memory; Artificial intelligence; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008680896,0.0006358301,0.0007427766,0.0006214364,0.000278839,0.0009283661,0.001842712,0.0005222391,0.00008277162],"category_scores_gemma":[0.0003513981,0.0005907398,0.0001476983,0.0005107839,0.0001651126,0.0002647659,0.002321125,0.001006258,0.00007328499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002209758,"about_ca_system_score_gemma":0.0003534594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001436547,"about_ca_topic_score_gemma":0.0000215627,"domain_scores_codex":[0.9954566,0.0003701604,0.0007752182,0.001763413,0.0009417088,0.0006929174],"domain_scores_gemma":[0.9966804,0.0003533114,0.0003953139,0.00157891,0.0005285818,0.0004634155],"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.00002332129,0.0005126325,0.00007473501,0.00006741069,0.00005900128,0.0000923093,0.0002801065,0.9786904,0.000007835219,0.001679268,0.002571729,0.01594119],"study_design_scores_gemma":[0.00178587,0.0002360369,0.001852552,0.0001149023,0.00001646229,0.00002263742,0.000009215405,0.9947864,0.00002261432,0.0001941685,0.0003494436,0.0006096309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002659473,0.0002063807,0.9940629,0.001612253,0.001030072,0.001605284,0.000022587,0.0005307699,0.0006637762],"genre_scores_gemma":[0.002745801,0.000687894,0.9929233,0.00120301,0.0001010951,0.0000932093,0.0001096065,0.00004332586,0.002092763],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.016096,"threshold_uncertainty_score":0.9996544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08187221506420697,"score_gpt":0.3351723236806518,"score_spread":0.2533001086164448,"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."}}