{"id":"W2081912802","doi":"10.4018/jamc.2012040102","title":"A Survey of Ant Colony Optimization Algorithms for Telecommunication Networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Quality of service; Computer network; Distributed computing; Routing (electronic design automation); Network congestion; Algorithm","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.000551181,0.001097834,0.001077934,0.000890074,0.0004666745,0.001404608,0.001016894,0.001142527,0.002083299],"category_scores_gemma":[0.001606656,0.0004378005,0.0005324701,0.002936369,0.0003997586,0.001104992,0.0006317057,0.0011546,0.001390439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004676734,"about_ca_system_score_gemma":0.0007865491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002018023,"about_ca_topic_score_gemma":0.00229025,"domain_scores_codex":[0.9994759,0.0001293507,0.00004878787,0.00007486541,0.0002436991,0.00002754328],"domain_scores_gemma":[0.9995477,0.0002309081,0.00003192924,0.0000364043,0.0001343197,0.00001875184],"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.00005210354,0.0001185364,0.0009006339,0.001336371,0.0001026112,0.0001185918,0.0001142332,0.137819,0.001839861,0.0472111,0.02122328,0.7891636],"study_design_scores_gemma":[0.00004222675,0.0001459378,0.0008684383,0.0006010269,0.00006741937,0.000542503,0.0001076087,0.5140102,0.001746153,0.06995139,0.4118698,0.00004727432],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.006120348,0.20012,0.7480922,0.001961233,0.001233695,0.000176477,0.0002434034,0.0006660071,0.04138668],"genre_scores_gemma":[0.1212526,0.2789648,0.5715368,0.001453876,0.001539285,0.0004490884,0.0007970849,0.0004364444,0.02356998],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.002083299,"threshold_uncertainty_score":0.006969333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03237711879606497,"score_gpt":0.3008920122124292,"score_spread":0.2685148934163643,"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."}}