{"id":"W1486515899","doi":"10.1109/cec.2003.1299889","title":"A control framework for ant-based routing algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network packet; Decoupling (probability); Routing table; Routing (electronic design automation); Ant colony optimization algorithms; Distributed computing; Static routing; Architecture; Ant colony; Computer network; Routing protocol; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002507466,0.000124194,0.0001648255,0.00004057552,0.000155628,0.0001452737,0.0004751885,0.00008363007,0.00001236704],"category_scores_gemma":[0.00008667275,0.0001062459,0.0001086483,0.0001904376,0.00002455427,0.0001533578,0.00002143045,0.0001109938,0.0000364544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003940356,"about_ca_system_score_gemma":0.0001472307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001203835,"about_ca_topic_score_gemma":0.00000468693,"domain_scores_codex":[0.9989556,0.00002162496,0.0001910156,0.0003215386,0.0001600886,0.0003501278],"domain_scores_gemma":[0.9989972,0.0004313412,0.00006426474,0.000311439,0.00009155868,0.0001041733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001027401,0.00003605365,0.00002778421,0.000002146563,0.00001180316,0.000003487657,0.00003001294,0.01342794,0.00001275183,0.7990205,0.00009249907,0.1873247],"study_design_scores_gemma":[0.002971857,0.0001284731,0.00006754064,0.00003382961,0.000009957045,0.000003406345,0.000009637566,0.9529303,0.0001869414,0.04186279,0.001610755,0.0001845349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002825791,0.00005924458,0.9900239,0.008045289,0.0004697223,0.0003463703,0.000002329861,0.0004575564,0.0003130013],"genre_scores_gemma":[0.6096941,4.444648e-7,0.3867859,0.003231059,0.0001888406,0.00005212256,6.980353e-7,0.000005708226,0.00004117117],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9395024,"threshold_uncertainty_score":0.4332583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01337318361045575,"score_gpt":0.2501665534934918,"score_spread":0.2367933698830361,"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."}}