{"id":"W2130375202","doi":"10.1109/icsmc.2002.1176009","title":"A novel computational intelligence approach for multiple-point routing in communication networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Steiner tree problem; Feature (linguistics); Genetic algorithm; Theoretical computer science; Artificial intelligence; Mathematical optimization; Distributed computing; Machine learning; Computer network; Mathematics","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.0004709259,0.0006816935,0.0006932585,0.0006252916,0.0005086838,0.001102637,0.001341711,0.001112802,0.002302242],"category_scores_gemma":[0.001339962,0.0002331596,0.000701003,0.000982292,0.000929923,0.001595635,0.001076718,0.001694084,0.0004377238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005397885,"about_ca_system_score_gemma":0.0006617605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007619311,"about_ca_topic_score_gemma":0.0009729592,"domain_scores_codex":[0.9995983,0.0001114218,0.00001890874,0.00005367287,0.0001851505,0.00003252274],"domain_scores_gemma":[0.9996872,0.0001960438,0.00002616019,0.00002790119,0.00004753082,0.00001511906],"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.00001864067,0.00004849699,0.0002177488,0.0002045107,0.00005600418,0.0001668855,0.00007330933,0.4843968,0.003492408,0.3871793,0.003604376,0.1205416],"study_design_scores_gemma":[0.00000900051,0.00003057951,0.00005202723,0.00002039393,0.00001032087,0.00008806182,0.0000138112,0.8938218,0.0006207548,0.09531257,0.01001121,0.00000955886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001345248,0.0004795239,0.9935187,0.0002971942,0.00009218509,0.00002329531,0.00001309616,0.0000575068,0.004173272],"genre_scores_gemma":[0.1236551,0.001930586,0.8659586,0.0003566573,0.0003058794,0.0003636249,0.00007782392,0.00006734758,0.00728441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002302242,"threshold_uncertainty_score":0.007701695,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02830619392555588,"score_gpt":0.2470683666746808,"score_spread":0.2187621727491249,"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."}}