{"id":"W2001178040","doi":"10.1109/tcomm.2013.020413.120457","title":"Delay-Optimal Distributed Scheduling in Multi-User Multi-Relay Cellular Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"","keywords":"Computer science; Relay; Scheduling (production processes); Computer network; Time division multiple access; RSS; Base station; Telecommunications link; Wireless; Transmission (telecommunications); Markov process; Wireless network; Real-time computing; Distributed computing; Mathematical optimization; Telecommunications; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354431,0.0008979993,0.001338047,0.0003767005,0.0006198756,0.0007332458,0.001936673,0.0008064808,0.000709425],"category_scores_gemma":[0.002705793,0.0004296486,0.0004878315,0.0007695815,0.0007635858,0.0009994416,0.001080001,0.000734428,0.0001688336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001228551,"about_ca_system_score_gemma":0.001197549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002976827,"about_ca_topic_score_gemma":0.002864055,"domain_scores_codex":[0.9989737,0.0003638639,0.00004481025,0.0001976073,0.0002540669,0.0001660876],"domain_scores_gemma":[0.9988047,0.0006084493,0.0001806576,0.0001379465,0.0001725483,0.00009573912],"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.00009626645,0.00006569167,0.0002926168,0.00006085512,0.00002744128,0.00009179277,0.00005569233,0.9591861,0.002821586,0.01137341,0.0005697763,0.02535881],"study_design_scores_gemma":[0.000008573177,0.00002174995,0.00002243446,0.000001108624,0.000003128827,0.00001054757,0.000003126366,0.9977233,0.0002639361,0.001775831,0.0001637693,0.000002629635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354946,0.0006382903,0.9744213,0.0001247219,0.00007580958,0.00004046325,0.00002966465,0.0001866402,0.0009336906],"genre_scores_gemma":[0.9272062,0.0004392308,0.0711656,0.00007213571,0.00008513326,0.00007489791,0.00004870243,0.00002283813,0.0008852598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002976827,"threshold_uncertainty_score":0.008913815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05484083326797545,"score_gpt":0.2892029471408835,"score_spread":0.2343621138729081,"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."}}