{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452962,0.0009001717,0.001195643,0.0005428399,0.0006401574,0.001099995,0.001034776,0.0008164789,0.002547976],"category_scores_gemma":[0.002384983,0.0006620132,0.0008599242,0.0008684861,0.000939238,0.00130764,0.0007888693,0.0009497446,0.0002179584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002081159,"about_ca_system_score_gemma":0.00198036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01249925,"about_ca_topic_score_gemma":0.0102197,"domain_scores_codex":[0.9992125,0.0003081882,0.00002625322,0.0001241793,0.0001344214,0.0001945436],"domain_scores_gemma":[0.9976065,0.001877526,0.0002034727,0.00007349646,0.0001428571,0.00009607821],"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.00005373466,0.00002450093,0.0001844009,0.00002923002,0.00002073648,0.00008721057,0.00003308637,0.9783334,0.0005695386,0.01633939,0.0003242943,0.004000549],"study_design_scores_gemma":[0.00000825645,0.00001106176,0.00003582258,0.000001573619,0.000004243965,0.000008336854,0.000004562059,0.9964593,0.00008182341,0.003259628,0.0001222668,0.000003168973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05009613,0.0005079596,0.9439726,0.0003951389,0.00006162942,0.00008457374,0.0001006933,0.000142689,0.004638594],"genre_scores_gemma":[0.9605002,0.000567964,0.03531355,0.00007349878,0.00004219698,0.0001148411,0.00007616288,0.00002922529,0.003282431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01249925,"threshold_uncertainty_score":0.02485299,"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."}}