{"id":"W2480493506","doi":"10.4018/978-1-61520-791-6.ch007","title":"Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Heuristic; Mathematical optimization; Computer science; Network topology; Path (computing); Routing (electronic design automation); Consistent heuristic; Algorithm; Mathematics; Incremental heuristic search; Search algorithm; Beam search","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003267768,0.0004156293,0.0006605426,0.00006324991,0.0002589414,0.000180193,0.000516114,0.0005185682,0.000003882643],"category_scores_gemma":[0.00004537365,0.0004107411,0.000164577,0.00005188074,0.0001012171,0.00009057254,0.000233421,0.000330654,0.000005378647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001346431,"about_ca_system_score_gemma":0.0002126685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001563265,"about_ca_topic_score_gemma":0.00005125965,"domain_scores_codex":[0.9977933,0.00004866057,0.0006850056,0.0006581753,0.00043148,0.0003833585],"domain_scores_gemma":[0.9981743,0.0002496929,0.000522199,0.0006126233,0.0002434144,0.0001978004],"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.00003764194,0.000004481735,0.00001803757,0.00004481032,0.00005862884,0.0000317799,0.00005284863,0.6159006,0.000004509297,0.2660834,0.00005494519,0.1177083],"study_design_scores_gemma":[0.0006112371,0.00004833822,0.000005748464,0.000904776,0.000104173,0.00010164,0.000005520926,0.9952083,0.000001497483,0.002218871,0.0004348177,0.0003550512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001043163,0.0007494949,0.9501967,0.000009041408,0.001607543,0.0005595127,0.00006599033,0.0002656873,0.04550283],"genre_scores_gemma":[0.8671604,0.000005151291,0.1314416,0.00005395644,0.0005609008,0.000007489373,0.000004033257,0.00003798512,0.0007285153],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8661172,"threshold_uncertainty_score":0.9998344,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01152774713212188,"score_gpt":0.2159924131813417,"score_spread":0.2044646660492198,"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."}}