{"id":"W2001042213","doi":"10.1109/allerton.2011.6120285","title":"On the complexity of wireless uplink scheduling with successive interference cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheduling (production processes); Telecommunications link; Single antenna interference cancellation; Maximum throughput scheduling; Fair-share scheduling; Round-robin scheduling; Wireless; Dynamic priority scheduling; Distributed computing; Computer network; Job shop scheduling; Proportionally fair; Mathematical optimization; Quality of service; Telecommunications; Mathematics; Channel (broadcasting)","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.004086913,0.001439721,0.002629886,0.0008223013,0.001829769,0.003386378,0.002108542,0.001768406,0.007530783],"category_scores_gemma":[0.02236441,0.0009520153,0.001189366,0.002211118,0.002283514,0.005987466,0.002532688,0.003372405,0.0007331371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004171591,"about_ca_system_score_gemma":0.003682501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007229837,"about_ca_topic_score_gemma":0.006772952,"domain_scores_codex":[0.9955018,0.002075351,0.0001512424,0.0004760491,0.001012913,0.00078268],"domain_scores_gemma":[0.9600371,0.03655233,0.001093126,0.001033917,0.0008724512,0.0004110878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005767392,0.0001431687,0.0009626374,0.0003176052,0.00008513667,0.0002358847,0.0002161231,0.868702,0.001229296,0.09072144,0.008458068,0.02835187],"study_design_scores_gemma":[0.00008864747,0.00003255071,0.0002445439,0.0000209245,0.00001972367,0.00005220045,0.00007588568,0.897799,0.0002899711,0.1002552,0.001105199,0.00001620529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1947708,0.005302026,0.7347116,0.01254191,0.0006846079,0.0005125205,0.001885562,0.001004952,0.048586],"genre_scores_gemma":[0.8493547,0.003600957,0.1329663,0.0009086709,0.0008334602,0.0006712758,0.001334761,0.0004994591,0.009830358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007530783,"threshold_uncertainty_score":0.03026718,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1497497811371318,"score_gpt":0.2839174538352481,"score_spread":0.1341676726981162,"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."}}