{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002883611,0.0004851565,0.0004986696,0.0006163577,0.0004060893,0.0004377379,0.0009496237,0.0008269567,0.001162473],"category_scores_gemma":[0.0007910053,0.0001941652,0.0004455307,0.0006314619,0.0003789508,0.0004590803,0.0005133188,0.0005657608,0.0002290262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004091727,"about_ca_system_score_gemma":0.0005756705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001994033,"about_ca_topic_score_gemma":0.001658243,"domain_scores_codex":[0.9997495,0.00008034988,0.000009538122,0.00003776724,0.0001016691,0.00002117869],"domain_scores_gemma":[0.9998742,0.0000574485,0.00001386647,0.00001375612,0.00003160115,0.000009088771],"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.0000506382,0.000118836,0.0007064855,0.0001175081,0.0000959663,0.0001930304,0.0001373251,0.6332386,0.02083063,0.07164051,0.002415691,0.2704548],"study_design_scores_gemma":[0.00001916091,0.00004952552,0.0001223835,0.00001075654,0.00001484008,0.0001069665,0.00001357148,0.9852747,0.001644334,0.00753506,0.005197813,0.00001080324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004497979,0.0001099203,0.9931003,0.00005559567,0.0000255311,0.00002978491,0.000009788953,0.0001077188,0.00206331],"genre_scores_gemma":[0.1413466,0.0002607202,0.8551472,0.0001240737,0.00003638241,0.000213752,0.00008346639,0.0000528045,0.002735004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001994033,"threshold_uncertainty_score":0.003964841,"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."}}