{"id":"W2083443394","doi":"10.1109/glocom.2006.418","title":"QRP01-1: Optimal Routing of Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Bottleneck; Computer science; Heuristics; Quality of service; Computer network; Bandwidth (computing); Tabu search; Service (business); Mathematical optimization; Distributed computing; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002225842,0.0001292907,0.0002027272,0.0000276727,0.00009552186,0.00008604033,0.0007316386,0.00006634048,0.00001519239],"category_scores_gemma":[0.000003605542,0.0001225763,0.00007866586,0.0003383816,0.00002788351,0.0002004923,0.0001701432,0.00009789334,0.00004454211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002394282,"about_ca_system_score_gemma":0.00004280924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001205439,"about_ca_topic_score_gemma":0.0001047686,"domain_scores_codex":[0.9987753,0.00005172451,0.0003270971,0.0002815404,0.0002113478,0.0003529838],"domain_scores_gemma":[0.9992382,0.00009042512,0.0001714884,0.0003590533,0.00008429858,0.00005652859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003502788,0.0001730483,0.01247703,0.00004208213,0.00005977162,0.00002520693,0.0001527867,0.3493783,0.0002352333,0.4212691,0.003282003,0.2128705],"study_design_scores_gemma":[0.0004464218,0.00004540023,0.0190835,0.00004052575,0.00001140739,0.000007932148,0.00001029656,0.9755367,0.00001546309,0.00156084,0.00306762,0.0001739153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1723289,0.0004188322,0.8172805,0.0008181717,0.0005861686,0.0001771866,0.000002988632,0.0003553738,0.008031826],"genre_scores_gemma":[0.9553422,0.000003390603,0.04387872,0.0002398878,0.0003093875,0.000005725085,0.000007599582,0.000006707964,0.0002063997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7830133,"threshold_uncertainty_score":0.4998516,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.002343904617799321,"score_gpt":0.1790592153204892,"score_spread":0.1767153107026899,"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."}}