{"id":"W2154477729","doi":"10.1109/isit.2009.5205796","title":"Opportunistic scheduling in large-scale wireless networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Transmitter; Rayleigh fading; Scheduling (production processes); Computer science; Fading; Computer network; Wireless network; Maximum throughput scheduling; Wireless; Topology (electrical circuits); Radio networks; Stochastic geometry models of wireless networks; Asymptotically optimal algorithm; Throughput; Hop (telecommunications); Channel (broadcasting); Radio resource management; Mathematics; Mathematical optimization; Dynamic priority scheduling; Round-robin scheduling; Telecommunications; Algorithm; Combinatorics; Quality of service","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123377,0.0005327645,0.0007891825,0.0004675582,0.001011602,0.001191346,0.001197287,0.0007421484,0.0007446819],"category_scores_gemma":[0.005480114,0.0004412664,0.0002760781,0.0009570286,0.0012917,0.001783726,0.001072298,0.0005707507,0.0001316003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232551,"about_ca_system_score_gemma":0.001068153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003499479,"about_ca_topic_score_gemma":0.003873667,"domain_scores_codex":[0.9987851,0.000606972,0.0000360622,0.0001489751,0.000258253,0.0001646668],"domain_scores_gemma":[0.995482,0.00333868,0.0004057965,0.0003294064,0.0002490038,0.0001951238],"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.0001026739,0.00003952574,0.000916278,0.0001043897,0.00004449911,0.0004770505,0.0001034775,0.9302652,0.001535763,0.05112262,0.001337188,0.01395136],"study_design_scores_gemma":[0.0000198913,0.00002216512,0.0001908324,0.000005359092,0.00001013123,0.00007519976,0.00004843745,0.9725358,0.0002275241,0.02569106,0.001166321,0.000007315823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1227839,0.003026848,0.8645982,0.0008392308,0.0002457637,0.0001350469,0.0001373258,0.0004822419,0.007751582],"genre_scores_gemma":[0.9790015,0.0007203694,0.01834839,0.00007670958,0.0000891719,0.00008468551,0.00005125378,0.00002654544,0.001601279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003499479,"threshold_uncertainty_score":0.01122957,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03458510057997188,"score_gpt":0.2833877465450808,"score_spread":0.2488026459651089,"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."}}