{"id":"W2122878358","doi":"10.1109/ccece.2004.1345236","title":"Comparing a novel QoS routing algorithm to standard pruning techniques used in QoS routing algorithms","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Mary's University; Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Quality of service; Pruning; Algorithm; Routing (electronic design automation); Path (computing); Dijkstra's algorithm; Heuristic; Shortest path problem; Mathematical optimization; Graph; Computer network; Mathematics; Theoretical computer science; Artificial intelligence","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.00157364,0.0006499595,0.0007252659,0.001022715,0.0006131317,0.0008978389,0.001341193,0.001205278,0.001673822],"category_scores_gemma":[0.005735367,0.000211656,0.000541503,0.001606382,0.0004750256,0.001900677,0.0008684993,0.001064482,0.0004022303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006555783,"about_ca_system_score_gemma":0.0009635166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002338408,"about_ca_topic_score_gemma":0.002623697,"domain_scores_codex":[0.9983133,0.0003623816,0.000112807,0.0001951082,0.0009085133,0.0001078897],"domain_scores_gemma":[0.9967263,0.001547486,0.0002277255,0.0004803794,0.0009381676,0.00007990997],"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.0007322835,0.0003787434,0.002045642,0.0002736213,0.0001289616,0.0001425704,0.0001048993,0.274826,0.02613842,0.02630972,0.003934775,0.6649843],"study_design_scores_gemma":[0.0001759292,0.0003211564,0.000819752,0.00002615682,0.00006196024,0.0004206254,0.00005241564,0.9700605,0.01198996,0.007616586,0.008433796,0.00002112938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03845659,0.001053082,0.953313,0.0005050369,0.000212648,0.0001349751,0.00008122079,0.001296681,0.004946833],"genre_scores_gemma":[0.1674797,0.000785939,0.8288005,0.0002191772,0.0001533098,0.0001130523,0.0002660473,0.0001615722,0.002020682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002338408,"threshold_uncertainty_score":0.008322299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02751839975874081,"score_gpt":0.2757944805590631,"score_spread":0.2482760808003223,"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."}}