{"id":"W2404589049","doi":"","title":"A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks","year":2012,"lang":"en","type":"article","venue":"Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Ant colony optimization algorithms; Computer science; Network topology; Link-state routing protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Computer network; Hybrid routing; Static routing; Wireless Routing Protocol; Distributed computing; Algorithm; Routing (electronic design automation); Routing protocol","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.0004284471,0.000620203,0.0007796669,0.0006060543,0.000480021,0.0007014775,0.001296981,0.0008831481,0.001538674],"category_scores_gemma":[0.0013912,0.0002572521,0.0003246856,0.000906194,0.0002695473,0.001029416,0.0007765397,0.0006266709,0.0007660683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002806093,"about_ca_system_score_gemma":0.0004589803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001748638,"about_ca_topic_score_gemma":0.002482722,"domain_scores_codex":[0.9994981,0.0001403681,0.00002601241,0.0000695425,0.0002438729,0.00002212349],"domain_scores_gemma":[0.9996932,0.0001222026,0.0000304781,0.00003864462,0.00009413323,0.00002142072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001565466,0.0001144518,0.0005239344,0.0001893733,0.0001046004,0.0001917672,0.00008744314,0.457966,0.01366845,0.0146049,0.006943124,0.5054494],"study_design_scores_gemma":[0.00003527534,0.00008508102,0.0001197481,0.000009431969,0.00001255718,0.0001529381,0.00001071746,0.9835072,0.001656498,0.004126533,0.01026944,0.00001477717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006801773,0.0007595974,0.9874571,0.0001605323,0.0001211229,0.0001297515,0.00005515574,0.001039185,0.003475721],"genre_scores_gemma":[0.16028,0.0006824399,0.8300512,0.0001966824,0.00005835128,0.0003797901,0.0002421903,0.0001625964,0.007946668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001748638,"threshold_uncertainty_score":0.005147338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04674685024821383,"score_gpt":0.2893180795073093,"score_spread":0.2425712292590954,"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."}}