{"id":"W1549894404","doi":"10.1007/11600930_101","title":"Heuristic Approaches to Service Level Agreements in Packet Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Heuristics; Quality of service; Admission control; Scalability; Reservation; The Internet; Computer network; Heuristic; Call Admission Control; Distributed computing; Network packet; Resource allocation; Computational complexity theory; Wireless network; Artificial intelligence; Wireless; Algorithm","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.004428031,0.001326769,0.001976549,0.001709388,0.001361312,0.002747153,0.003694267,0.002359728,0.007004071],"category_scores_gemma":[0.01399131,0.001525136,0.001138272,0.003581859,0.00315363,0.003561666,0.001974711,0.003383645,0.0006630806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002976357,"about_ca_system_score_gemma":0.00258689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004481206,"about_ca_topic_score_gemma":0.004549814,"domain_scores_codex":[0.997109,0.001725837,0.00008235288,0.0001669695,0.0006106157,0.0003052203],"domain_scores_gemma":[0.9919258,0.006862123,0.0002341829,0.0004135476,0.0003819099,0.0001825483],"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.00007009543,0.00007641415,0.0001359594,0.0001047952,0.00003159355,0.0000346156,0.0001142499,0.6631916,0.0001625065,0.3040669,0.002606787,0.02940455],"study_design_scores_gemma":[0.00002917067,0.00001657578,0.00002595475,0.00001623642,0.00001031443,0.00001104021,0.00003121046,0.8191736,0.0001032093,0.1792849,0.001290489,0.000007315409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006892858,0.0009134213,0.9828441,0.0004535536,0.0001156567,0.00009226397,0.00005782097,0.0001661117,0.008464152],"genre_scores_gemma":[0.3436676,0.00258811,0.6432932,0.0002524842,0.0004406524,0.0004890598,0.0002167874,0.0002189399,0.008833117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007004071,"threshold_uncertainty_score":0.023431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07028767277108075,"score_gpt":0.2342497189885636,"score_spread":0.1639620462174829,"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."}}