{"id":"W2140332083","doi":"10.1109/infcom.2011.5934911","title":"Scheduling in wireless ad hoc networks with successive interference cancellation","year":2011,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless ad hoc network; Computer network; Testbed; Wireless network; Single antenna interference cancellation; Greedy algorithm; Distributed computing; Wireless; Channel (broadcasting); Algorithm; Mathematics; Mathematical optimization; Telecommunications","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.0001569509,0.00009817318,0.0001080696,0.00007587513,0.00008429544,0.00007246404,0.0007003314,0.00003481833,0.0000609301],"category_scores_gemma":[0.000007744465,0.00007839152,0.00001362703,0.0005219867,0.00003758398,0.0004332523,0.0002369076,0.0001794884,0.000008734281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004547851,"about_ca_system_score_gemma":0.00005062569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000225824,"about_ca_topic_score_gemma":0.002378866,"domain_scores_codex":[0.9992619,0.00008062606,0.0001636572,0.0002356155,0.00007941696,0.0001788571],"domain_scores_gemma":[0.9992909,0.00006563643,0.00007033879,0.0004185682,0.0001060727,0.00004849703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008298943,0.00013365,0.02812177,0.000009744645,0.00002325631,0.00002069724,0.009214791,0.01263198,0.0003557624,0.1747751,0.00006917288,0.7745611],"study_design_scores_gemma":[0.0002925133,0.00007393667,0.008617444,0.0001266933,0.000001385727,0.000002538265,0.00009645615,0.9896134,0.0007392653,0.000138108,0.0001195509,0.0001787304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07656673,0.0006859332,0.9133908,0.0001781728,0.00007959487,0.0001021071,5.573025e-8,0.0000817106,0.008914859],"genre_scores_gemma":[0.9677863,0.0009109101,0.03093647,0.000181871,0.00001219174,0.00001573801,0.000001057085,0.000004953544,0.0001505557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9769814,"threshold_uncertainty_score":0.3196713,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04827046807939579,"score_gpt":0.258134983228936,"score_spread":0.2098645151495402,"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."}}