{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260536,0.0001190459,0.0001319915,0.00006860631,0.00009662389,0.0002159471,0.0008492092,0.00005374759,0.00002135189],"category_scores_gemma":[0.000005424608,0.00009917666,0.00005017999,0.0004308634,0.00001223131,0.0002531042,0.0001530419,0.0001056459,0.0001772197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002865129,"about_ca_system_score_gemma":0.00006406117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001274302,"about_ca_topic_score_gemma":0.000006878137,"domain_scores_codex":[0.9988949,0.00003464394,0.0001653459,0.000370359,0.0002156222,0.0003191197],"domain_scores_gemma":[0.9991904,0.00004095528,0.00003114597,0.000524727,0.00004367661,0.0001691036],"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.00001129527,0.0002250554,0.0002306243,0.00002028865,0.000008127669,0.000002243488,0.0002486312,0.4557546,0.0003197932,0.2041889,0.003815467,0.3351749],"study_design_scores_gemma":[0.000247784,0.00003355375,0.00009372857,0.00001705854,8.398463e-7,0.000002054863,0.00000525618,0.9651674,0.001786731,0.0001322446,0.03234326,0.0001700949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002316012,0.00001252002,0.9661544,0.001990081,0.00004824485,0.001837288,2.573927e-7,0.0002712389,0.02736998],"genre_scores_gemma":[0.5161047,2.045786e-7,0.4797832,0.002704222,0.0001689043,0.0009301886,6.550235e-7,0.000006642488,0.0003012606],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5137887,"threshold_uncertainty_score":0.4044307,"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."}}