{"id":"W1912426016","doi":"10.1109/ipdps.2003.1213470","title":"A parallel ant colony optimization algorithm for all-pair routing in MANETs","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Mobile ad hoc network; Ant colony optimization algorithms; Distributed computing; Wireless ad hoc network; Routing (electronic design automation); Parallel computing; Heuristic; Load balancing (electrical power); Destination-Sequenced Distance Vector routing; Speedup; Workstation; Computer network; Routing protocol; Link-state routing protocol; Wireless; Algorithm; Network packet","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.0005157981,0.0007879219,0.0009833809,0.0005459108,0.0006203458,0.0005628198,0.001348202,0.0007695489,0.001686527],"category_scores_gemma":[0.001324176,0.0003674396,0.0004276697,0.0007410149,0.0004667738,0.0006503707,0.0007234404,0.000635856,0.0004370056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000459207,"about_ca_system_score_gemma":0.00101116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004031557,"about_ca_topic_score_gemma":0.005524945,"domain_scores_codex":[0.9997239,0.00008903605,0.00001364683,0.00004213152,0.0001044955,0.00002678533],"domain_scores_gemma":[0.9996706,0.0001605361,0.00004066134,0.00002664876,0.00007816963,0.00002334913],"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.00004674196,0.00003953079,0.0002573342,0.00005204472,0.00003583038,0.0000598971,0.00003862969,0.9318048,0.001335219,0.006141029,0.00171469,0.05847419],"study_design_scores_gemma":[0.00002077763,0.00001886145,0.00003159322,0.000002202074,0.000004404983,0.00001516399,0.000006351819,0.9965508,0.0002313945,0.002253528,0.0008618141,0.000003006362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009737219,0.0002836854,0.9857836,0.00017208,0.00006888549,0.0001085844,0.00003931716,0.0005913341,0.003215356],"genre_scores_gemma":[0.2166072,0.0003487936,0.7769676,0.0001195106,0.0000521886,0.000422157,0.000145812,0.0001514351,0.005185383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004031557,"threshold_uncertainty_score":0.008016229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01471220152327829,"score_gpt":0.2504721206419687,"score_spread":0.2357599191186904,"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."}}