{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001067321,0.0002621754,0.0003604718,0.0003006739,0.0003092238,0.000636061,0.0007041935,0.0001069524,0.000002501658],"category_scores_gemma":[0.00007643062,0.0002614027,0.00005291568,0.001455207,0.00002897248,0.0008827834,0.0004182128,0.0003103924,0.000007805518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003760491,"about_ca_system_score_gemma":0.0001932796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002915478,"about_ca_topic_score_gemma":0.0001075243,"domain_scores_codex":[0.9976539,0.00004286937,0.0005353526,0.000656621,0.0004541004,0.000657163],"domain_scores_gemma":[0.9990658,0.00006615,0.0001643376,0.000394006,0.0001558491,0.000153927],"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.00001924676,0.0002332449,0.006725828,0.0000407622,0.00002808251,0.00004977936,0.01292481,0.3038635,0.001803689,0.01368908,0.0001058291,0.6605161],"study_design_scores_gemma":[0.0009350245,0.0001036255,0.0003394867,0.0005998855,0.000004663008,0.00002234415,0.0002667911,0.9828518,0.01382157,0.0003964114,0.0002055598,0.0004528406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006109464,0.00002323259,0.9897211,0.0004716752,0.0003160792,0.0003508066,0.000001031906,0.000955613,0.002050998],"genre_scores_gemma":[0.3768195,0.000002158135,0.6226692,0.0002219488,0.0001947649,0.00002059855,0.000002713967,0.00001881423,0.00005031534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6789883,"threshold_uncertainty_score":0.9999838,"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."}}