{"id":"W4288640804","doi":"10.48550/arxiv.1901.02111","title":"Scheduling for VoLTE: Resource Allocation Optimization and\\n Low-Complexity Algorithms","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Fair-share scheduling; Mathematical optimization; Proportionally fair; Maximization; Rate-monotonic scheduling; Round-robin scheduling; Quality of service; Optimization problem; Algorithm; Computer network; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004344854,0.0008653899,0.00081404,0.0004480694,0.000455033,0.0001640282,0.0006479597,0.0009229027,0.00006719964],"category_scores_gemma":[0.0001129174,0.001266832,0.000269238,0.0008752888,0.0002502029,0.0008139556,0.0005929436,0.0008524776,0.00003382423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008586121,"about_ca_system_score_gemma":0.0001432864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003257987,"about_ca_topic_score_gemma":0.00001220099,"domain_scores_codex":[0.9963856,0.000151949,0.0006565147,0.001848222,0.0001504893,0.0008071995],"domain_scores_gemma":[0.9971366,0.0003344443,0.0005892276,0.001132536,0.0005102931,0.0002969058],"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.000173851,0.0000726741,0.0002078484,0.0009953397,0.0001697973,0.000007619429,0.0002151895,0.9809271,0.00006751777,0.01572231,0.00003899854,0.001401721],"study_design_scores_gemma":[0.001840667,0.00007795478,0.00009137688,0.0005990153,0.0003257015,0.000003748516,0.0002809556,0.9926394,0.0002015739,0.002457095,0.0002981578,0.001184308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02633267,0.0003507136,0.9690861,0.0000608201,0.0009224283,0.00217615,0.00008923397,0.0004645939,0.0005172513],"genre_scores_gemma":[0.8528021,0.002520675,0.1421794,0.00004274779,0.0004162995,0.0000109146,0.0009695554,0.0002152002,0.00084315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8269068,"threshold_uncertainty_score":0.9989781,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05259215605244581,"score_gpt":0.1897813181706216,"score_spread":0.1371891621181758,"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."}}