{"id":"W2142186130","doi":"10.1109/icc.2005.1494986","title":"A DAG-based approach to wireless scheduling","year":2005,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Directed acyclic graph; Correctness; Computer network; Directed graph; Greedy algorithm; Theoretical computer science; Mathematical optimization; Algorithm; 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.002358874,0.00107022,0.001028515,0.0015339,0.001813671,0.002636535,0.002621403,0.001247827,0.003988585],"category_scores_gemma":[0.005885927,0.0006069873,0.001456551,0.003228391,0.002015875,0.00354784,0.002481605,0.002800923,0.001033279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0023475,"about_ca_system_score_gemma":0.002821353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004796357,"about_ca_topic_score_gemma":0.006114679,"domain_scores_codex":[0.9982719,0.0007191512,0.0001182273,0.0002752529,0.0004065907,0.0002088463],"domain_scores_gemma":[0.9981084,0.0008614013,0.0001551831,0.0004262644,0.0002551195,0.0001936811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000615207,0.00006796543,0.0003469748,0.000154635,0.00004805931,0.0001912536,0.0001995009,0.2405311,0.001377721,0.7013253,0.003994981,0.05170092],"study_design_scores_gemma":[0.00003239848,0.00004844664,0.00007156065,0.00002948748,0.00003343116,0.0001033009,0.00006520967,0.4334704,0.0006880073,0.5342397,0.0311933,0.00002479181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002105084,0.0004485429,0.9928464,0.0006576751,0.0002034474,0.00006266654,0.00009201444,0.0002159934,0.003368217],"genre_scores_gemma":[0.145006,0.002760241,0.842114,0.0004317747,0.0004204438,0.000320333,0.0003609566,0.0001643631,0.008421886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004796357,"threshold_uncertainty_score":0.01703238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02372468545799361,"score_gpt":0.2632678191921612,"score_spread":0.2395431337341676,"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."}}