{"id":"W2037785008","doi":"10.1155/2010/418934","title":"On the Complexity of Scheduling in Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Wireless network; Time complexity; Distributed computing; Wireless; Approximation algorithm; Computational complexity theory; Greedy algorithm; Mathematical optimization; Computer network; 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.004350533,0.001601599,0.00226341,0.001270671,0.001849137,0.003980702,0.002277908,0.00235288,0.004914305],"category_scores_gemma":[0.02901855,0.001083794,0.001248922,0.002817758,0.003081617,0.008793145,0.002799864,0.003762246,0.0005971048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00446467,"about_ca_system_score_gemma":0.002705963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005820688,"about_ca_topic_score_gemma":0.004105328,"domain_scores_codex":[0.9956215,0.002026392,0.0002050498,0.0005139191,0.001029408,0.0006036816],"domain_scores_gemma":[0.960448,0.03573767,0.001275517,0.001224343,0.0007875006,0.0005271409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003428106,0.000103092,0.001250306,0.0003468122,0.00009633877,0.000172521,0.0002165721,0.8214918,0.001027799,0.1377975,0.007298757,0.02985569],"study_design_scores_gemma":[0.00004114783,0.00002076249,0.0002265471,0.00002409801,0.0000164563,0.00004358021,0.00005750959,0.8160857,0.000213335,0.1817888,0.001469587,0.00001242114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1495735,0.008675968,0.7863113,0.01905191,0.000804313,0.0003742758,0.001434557,0.0009107232,0.03286345],"genre_scores_gemma":[0.8115556,0.008348539,0.1669,0.001240572,0.001305402,0.000723624,0.001311034,0.0005225873,0.008092748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005820688,"threshold_uncertainty_score":0.03239363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05349021118341814,"score_gpt":0.2816610418362372,"score_spread":0.2281708306528191,"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."}}