{"id":"W2102094420","doi":"10.1109/ccece.2003.1226095","title":"A novel genetic algorithm searching approach for dynamic constrained multicast routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Multicast; Computer science; Routing (electronic design automation); Tree (set theory); Path (computing); Convergence (economics); Quality of service; Algorithm; Protocol Independent Multicast; Encoding (memory); Scheme (mathematics); Genetic algorithm; Distance Vector Multicast Routing Protocol; Variation (astronomy); Distributed computing; Computer network; Xcast; Mathematical optimization; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495265,0.0001388951,0.0001527406,0.00005778612,0.0001918029,0.0001727885,0.0004784347,0.00005118586,0.00000373515],"category_scores_gemma":[0.00002884234,0.0001244937,0.00008376488,0.000181431,0.00005872495,0.0001476273,0.00008952133,0.0001221602,0.000008092386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005246833,"about_ca_system_score_gemma":0.0001325473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003103545,"about_ca_topic_score_gemma":0.000005790997,"domain_scores_codex":[0.9987575,0.00001834028,0.0002165627,0.0004156805,0.0001762484,0.0004156752],"domain_scores_gemma":[0.9993547,0.0001263119,0.00004979243,0.0002716201,0.00007617228,0.0001214257],"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.000002700842,0.00008902098,0.000004754377,0.000005905395,0.00002025094,0.000002697915,0.0001988469,0.04098561,0.000343072,0.0398514,0.000003789603,0.918492],"study_design_scores_gemma":[0.001957421,0.00005342265,0.0001759863,0.00001067672,0.000007171844,0.00006526286,0.00008363542,0.9968781,0.00002594774,0.000544091,0.0000332475,0.000165021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008646435,0.00003506529,0.996778,0.0005779644,0.0001232972,0.0004584985,0.000004553791,0.0002931132,0.0008648521],"genre_scores_gemma":[0.4606756,8.543611e-7,0.5389706,0.0001724427,0.00004536537,0.00003432538,0.0000025999,0.000006357332,0.00009185803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9558925,"threshold_uncertainty_score":0.5076705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01484347229872943,"score_gpt":0.2467710825289054,"score_spread":0.231927610230176,"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."}}