{"id":"W1993297616","doi":"10.1109/infcom.2010.5462013","title":"Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scheduling (production processes); Fair-share scheduling; Distributed computing; Dynamic priority scheduling; Job shop scheduling; Round-robin scheduling; Maximum throughput scheduling; Rate-monotonic scheduling; Computational complexity theory; Wireless network; Mathematical optimization; Wireless; Algorithm; Computer network; Mathematics; Quality of service","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.0001839471,0.0001780618,0.0002035964,0.00006623811,0.00006250404,0.00002645858,0.0000837012,0.0001832991,0.00005530621],"category_scores_gemma":[0.00004124392,0.0001736242,0.00005030552,0.0002377902,0.00003843415,0.000258596,0.00001224292,0.0005541421,0.000003926255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004079732,"about_ca_system_score_gemma":0.00002873591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002999763,"about_ca_topic_score_gemma":0.00008832134,"domain_scores_codex":[0.9990306,0.0000208309,0.0002798732,0.0002187911,0.00007879839,0.000371075],"domain_scores_gemma":[0.9992802,0.0003689633,0.00002996171,0.0001354322,0.00006151183,0.0001239188],"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.0000148699,0.00003209493,0.00003141819,0.00001075633,0.00001150734,0.000002660084,0.00004554257,0.9593903,0.0009156537,0.008493043,0.0001725599,0.03087954],"study_design_scores_gemma":[0.0006649352,0.00002368614,0.0000631592,0.00003324149,0.000009781258,0.000003474806,0.00006358136,0.9965787,0.00125302,0.0001697467,0.0009120831,0.0002246058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006780466,0.00005720791,0.9907875,0.0001384368,0.001034062,0.0004730323,0.000004190998,0.0002905125,0.0004345879],"genre_scores_gemma":[0.7305015,0.0001019186,0.2689568,0.00002542791,0.0001973119,0.0001128377,0.00002498007,0.00004736593,0.00003185836],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.723721,"threshold_uncertainty_score":0.708019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02636296342750339,"score_gpt":0.297542455844979,"score_spread":0.2711794924174756,"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."}}