{"id":"W1575361522","doi":"10.1007/978-3-540-24840-8_62","title":"Genetic Algorithm Based OSPF Network Routing Using LEDA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Open Shortest Path First; Quality of service; Genetic algorithm; Context (archaeology); Routing protocol; Routing (electronic design automation); Shortest path problem; Distributed computing; Computer network; Routing algorithm; Algorithm; Link-state routing protocol; Theoretical computer science; Machine learning","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.0005357693,0.0003617052,0.0006243465,0.0007378458,0.0005772153,0.0007935888,0.001051549,0.0008523412,0.001782381],"category_scores_gemma":[0.001162188,0.0002554045,0.000435609,0.000671322,0.0003658067,0.0004839124,0.0005272148,0.0006319203,0.0002988019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008140302,"about_ca_system_score_gemma":0.0009309634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007025926,"about_ca_topic_score_gemma":0.004810866,"domain_scores_codex":[0.999747,0.00008000171,0.00001038101,0.00004249763,0.00008796043,0.0000322364],"domain_scores_gemma":[0.9996343,0.0001509775,0.00002385744,0.00004344115,0.00012915,0.0000183502],"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.00006614019,0.0001108519,0.000870668,0.00004609265,0.00005538936,0.00007321373,0.0000658924,0.7910558,0.006298947,0.01819027,0.00204217,0.1811246],"study_design_scores_gemma":[0.00001339492,0.00002389141,0.0001192949,0.000005250283,0.00001321045,0.00002097309,0.000007474586,0.9956313,0.00106501,0.002106431,0.0009864022,0.000007343252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04899691,0.0003133872,0.9377146,0.0002321144,0.0001889331,0.0001130293,0.0000701402,0.001273131,0.0110979],"genre_scores_gemma":[0.4982178,0.0002379944,0.4930655,0.0001552669,0.00004422193,0.0002424069,0.0001591729,0.0001033565,0.007774113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007025926,"threshold_uncertainty_score":0.01397008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0136155464725804,"score_gpt":0.2233515970803785,"score_spread":0.2097360506077981,"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."}}