{"id":"W2472981973","doi":"10.1049/iet-com.2016.0076","title":"Opportunistic scheduling for a two‐way relay network using Markov decision process","year":2016,"lang":"en","type":"article","venue":"IET Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Relay; Markov decision process; Markov process; Scheduling (production processes); Partially observable Markov decision process; Computer network; Decision process; Markov chain; Markov model; Mathematical optimization; Machine learning; Mathematics; Business; Statistics; Process management","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.001049596,0.0001827794,0.0002196139,0.0001035155,0.001294149,0.0001881891,0.004083531,0.00006851066,0.00002457262],"category_scores_gemma":[0.0004861249,0.0001458632,0.0001049206,0.0006969158,0.0001555033,0.0005781975,0.001408655,0.0001892942,0.00002601564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001158114,"about_ca_system_score_gemma":0.000214974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003679851,"about_ca_topic_score_gemma":0.00007610164,"domain_scores_codex":[0.9983175,0.0002732417,0.0004817443,0.0003554354,0.0001938983,0.0003782296],"domain_scores_gemma":[0.9931536,0.001958893,0.0002310722,0.003993499,0.0005140999,0.0001488007],"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.00002951421,0.0001847216,0.0006907752,0.00001445383,0.00005866009,0.000001131561,0.0006594515,0.003986695,0.00374446,0.4169741,0.001717345,0.5719387],"study_design_scores_gemma":[0.001214505,0.00006110342,0.0003275303,0.0006677459,0.00003181844,0.00002239008,0.00003992461,0.9330253,0.0001662895,0.02047358,0.04349337,0.0004764396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00340162,0.001261394,0.9871692,0.005656192,0.0002220589,0.0004633431,0.000008708273,0.0002222614,0.001595233],"genre_scores_gemma":[0.5703532,0.0008949022,0.4280823,0.0003202661,0.00006975383,0.0001189012,0.000009692655,0.00001746002,0.0001334937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9290386,"threshold_uncertainty_score":0.9953682,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1171199203871246,"score_gpt":0.3775115935772936,"score_spread":0.2603916731901691,"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."}}