{"id":"W2759905166","doi":"10.1109/lcomm.2017.2752714","title":"User Association and Scheduling With Hard Deadlines in Heterogeneous Cellular Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Approximation algorithm; Benchmark (surveying); Mathematical optimization; Heuristic; Computational complexity theory; Distributed computing; Algorithm; Mathematics; Artificial intelligence","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.0001228956,0.0001200905,0.0001369204,0.00006223448,0.0003000757,0.0001263108,0.0004458793,0.00007319979,0.000001330956],"category_scores_gemma":[0.00002390172,0.0001312041,0.00001757238,0.0000780949,0.00006643982,0.0003053466,0.00006648089,0.0002424252,0.000003014229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321626,"about_ca_system_score_gemma":0.000004432483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001873904,"about_ca_topic_score_gemma":0.0002487036,"domain_scores_codex":[0.9993894,0.00004196918,0.0001727128,0.0001220128,0.0000796941,0.0001942039],"domain_scores_gemma":[0.9986086,0.000099941,0.0001108727,0.001110549,0.00003517678,0.000034899],"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.000002947627,0.000007294595,0.02802493,0.000006063123,0.00002229702,0.000001947159,0.00005873839,0.968385,0.002283869,0.0000201679,0.00007090797,0.001115812],"study_design_scores_gemma":[0.0003454436,0.000005158368,0.007078632,0.00007417861,0.00001601205,0.000002524588,0.000009410164,0.9908777,0.0007357994,0.00001126249,0.0006565002,0.0001873313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6575858,0.0007031071,0.3397314,0.001458671,0.0001335809,0.0001687096,0.000001886619,0.0001332318,0.00008356479],"genre_scores_gemma":[0.9515136,0.001014742,0.04712738,0.0001623967,0.00006328703,0.00004474644,0.00002047839,0.00003746857,0.00001582638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2939278,"threshold_uncertainty_score":0.535035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01440359911189616,"score_gpt":0.2273144345417579,"score_spread":0.2129108354298617,"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."}}