{"id":"W2145835133","doi":"10.1109/lcn.2006.322074","title":"An Adaptive Non-preemptive Scheduling Framework for Delay Bounded Traffic in Cellular Networks","year":2006,"lang":"en","type":"article","venue":"Conference on Local Computer Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scheduling (production processes); Provisioning; Traffic generation model; Wireless network; Software deployment; Distributed computing; Cellular network; Online algorithm; Wireless","routes":{"ca_aff":true,"ca_fund":true,"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.0002035088,0.0005377774,0.0005517644,0.0001654812,0.0001559541,0.0001688124,0.0004431011,0.0005886738,0.00001487954],"category_scores_gemma":[0.000004033312,0.0006049485,0.0001183823,0.0005326209,0.000140103,0.0003341535,0.0000499161,0.0009535954,0.000006824816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002645479,"about_ca_system_score_gemma":0.00003822284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001126108,"about_ca_topic_score_gemma":0.0001147567,"domain_scores_codex":[0.9975545,0.00008801117,0.0005809041,0.0006848509,0.0001773611,0.0009143321],"domain_scores_gemma":[0.998742,0.0003372061,0.0001157268,0.0004764265,0.0001530124,0.0001755817],"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.0001491239,0.00008528912,0.00003714217,0.00001364097,0.00002517228,0.00001880763,0.00008392699,0.9280791,0.000004755105,0.02007989,0.0001070759,0.05131604],"study_design_scores_gemma":[0.0007962537,0.0004069866,0.0001467055,0.0004260094,0.00001484745,0.000002254518,0.00005050447,0.991371,0.00003933288,0.006058686,0.00003444733,0.0006530049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02440477,0.0003920011,0.9726753,0.00001555068,0.001041859,0.0008005764,0.000005096926,0.0004828462,0.0001820122],"genre_scores_gemma":[0.799684,0.00005847913,0.1984012,0.0000913346,0.001364057,0.0001246011,0.0001627365,0.0001082912,0.000005208677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7752793,"threshold_uncertainty_score":0.9996402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01244054678955593,"score_gpt":0.2294168713468777,"score_spread":0.2169763245573217,"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."}}