{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00183272,0.0006737518,0.0009515433,0.00113667,0.00106262,0.001779968,0.001522834,0.00113004,0.006644115],"category_scores_gemma":[0.004082969,0.0005476241,0.0005010343,0.001644253,0.001060039,0.001351576,0.001068746,0.0007265249,0.0008054821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107316,"about_ca_system_score_gemma":0.002597182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006809376,"about_ca_topic_score_gemma":0.006202612,"domain_scores_codex":[0.9987741,0.0005728084,0.0000423328,0.0001370466,0.000211582,0.0002621022],"domain_scores_gemma":[0.9989249,0.0004895049,0.000111506,0.0001592932,0.0002408266,0.00007406696],"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.000266849,0.0001232658,0.0009021423,0.0001636646,0.00004393155,0.00009898787,0.0001214864,0.8478907,0.002955717,0.0479957,0.01104495,0.0883927],"study_design_scores_gemma":[0.00003623492,0.00006104036,0.0001817398,0.00001340082,0.000007159446,0.00005663872,0.00004664838,0.9789039,0.001477957,0.01611365,0.003091499,0.00001020986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1104327,0.0007686683,0.8521535,0.001043952,0.000167068,0.0004535853,0.0009164964,0.001582748,0.03248137],"genre_scores_gemma":[0.5492143,0.0004824331,0.4422395,0.0002640898,0.00006847223,0.0001991986,0.0009392149,0.0003031003,0.006289762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006809376,"threshold_uncertainty_score":0.02222675,"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."}}