{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001499871,0.0006357303,0.0006670182,0.0006188251,0.0007695272,0.0006473631,0.0007752255,0.0004326146,0.000502234],"category_scores_gemma":[0.003133465,0.0004285362,0.000385994,0.001314581,0.0009426617,0.000858606,0.0006359378,0.000553363,0.0001281181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009512343,"about_ca_system_score_gemma":0.001300254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002496246,"about_ca_topic_score_gemma":0.002477604,"domain_scores_codex":[0.9989485,0.0005102666,0.00004875175,0.0001041275,0.0002883848,0.0001000105],"domain_scores_gemma":[0.9979076,0.001377651,0.0002284231,0.0002189042,0.0001933594,0.00007405945],"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.00009261903,0.0000460058,0.000476778,0.00007718538,0.00002778873,0.00008900231,0.00009686739,0.9261913,0.005086027,0.02917963,0.0007644495,0.0378724],"study_design_scores_gemma":[0.0000158075,0.00005404116,0.0001054865,0.000003756143,0.000006605616,0.00003811441,0.00001750794,0.981128,0.001080592,0.01681295,0.0007307739,0.000006368196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04874453,0.0006760108,0.9474753,0.0001806412,0.00005538582,0.00008673849,0.00004693769,0.000278809,0.002455583],"genre_scores_gemma":[0.7782741,0.0008832096,0.2188979,0.0001066983,0.0000968185,0.0001728733,0.0001027514,0.00004991652,0.00141566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002496246,"threshold_uncertainty_score":0.007932186,"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."}}