{"id":"W2018822015","doi":"10.1109/glocom.2012.6503850","title":"Opportunistic scheduling in dual-hop multiuser relay networks in the presence of co-channel interference","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Outage probability; Relay; Co-channel interference; Computer science; Interference (communication); Scheduling (production processes); Computer network; Hop (telecommunications); Channel (broadcasting); Dual (grammatical number); Relay channel; Single antenna interference cancellation; Topology (electrical circuits); Fading; Mathematics; Mathematical optimization; Engineering; Physics; Electrical engineering","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.002157146,0.0005004985,0.0008876112,0.000580147,0.0008200989,0.001380769,0.0009725741,0.0007866297,0.0004465901],"category_scores_gemma":[0.006418464,0.0005654242,0.0002827581,0.0009179709,0.00111943,0.001049427,0.000884418,0.000430401,0.00008746512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428608,"about_ca_system_score_gemma":0.0009083542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002912646,"about_ca_topic_score_gemma":0.003094123,"domain_scores_codex":[0.9990662,0.0004270689,0.00003577228,0.00009165881,0.0001802192,0.0001992234],"domain_scores_gemma":[0.9929883,0.005457853,0.0006867508,0.0002608104,0.0003685129,0.0002377234],"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.0003151774,0.00005003547,0.001842348,0.00007093836,0.0000535625,0.0007991747,0.0001767734,0.9603372,0.003443435,0.02222344,0.0005068394,0.01018112],"study_design_scores_gemma":[0.00001237944,0.00003232266,0.0002346457,0.000003182119,0.00001522343,0.0001020412,0.00003659247,0.993331,0.000479466,0.005571882,0.0001731376,0.000008010061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5190077,0.002047945,0.4712706,0.0005325347,0.00009280146,0.00005778523,0.00009504207,0.0002117417,0.006683803],"genre_scores_gemma":[0.9948381,0.0002092516,0.004553086,0.00001491043,0.00001595712,0.00001182976,0.000009134384,0.000007842241,0.0003398765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002912646,"threshold_uncertainty_score":0.01140827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09527781068218759,"score_gpt":0.3239013288977114,"score_spread":0.2286235182155238,"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."}}