{"id":"W1923117336","doi":"10.1007/978-3-642-10677-4_27","title":"Quasi-Deterministic Partially Observable Markov Decision Processes","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Observability; Computer science; Observable; Markov decision process; Hierarchy; Mathematical optimization; Theoretical computer science; Polynomial hierarchy; Decision problem; Time complexity; Markov process; Algorithm; Mathematics; Applied mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001161174,0.000677921,0.0006793417,0.0007493699,0.0003678025,0.001033831,0.004748776,0.0003955496,0.00001224004],"category_scores_gemma":[0.001494139,0.0006103259,0.0001241239,0.0009752436,0.0004728246,0.0006705331,0.001205363,0.0007438942,0.00004848859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000247734,"about_ca_system_score_gemma":0.001375828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002402462,"about_ca_topic_score_gemma":0.00005550406,"domain_scores_codex":[0.9951779,0.00003557385,0.0007051977,0.001929157,0.001293438,0.0008587585],"domain_scores_gemma":[0.9947615,0.00211442,0.0003787969,0.002005952,0.0005026248,0.0002367374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007364449,0.00006116313,0.0001066383,0.00005914586,0.000003355299,0.0001682279,0.0001799069,0.001772707,0.000007002096,0.001052328,0.0002531295,0.996329],"study_design_scores_gemma":[0.0001661206,0.0006988369,0.0001940468,0.001577301,0.00001004248,0.0001777898,1.543276e-8,0.2130864,0.00038363,0.780616,0.002229135,0.0008606567],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004119784,0.0005907216,0.9917412,0.0003821483,0.0009651073,0.000364525,0.000003151757,0.004002237,0.001909737],"genre_scores_gemma":[0.07771048,0.00007112316,0.9195482,0.001858182,0.0003681332,0.00001526834,0.000003999792,0.0000432276,0.0003813872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9954684,"threshold_uncertainty_score":0.9996348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0270488405458865,"score_gpt":0.2727263273379048,"score_spread":0.2456774867920183,"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."}}