{"id":"W2125781122","doi":"10.1109/qest.2005.4","title":"An approximation algorithm for labelled Markov processes: towards realistic approximation","year":2005,"lang":"en","type":"article","venue":"","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Scheme (mathematics); Computer science; Approximation algorithm; Kernel (algebra); Stochastic approximation; Markov process; Approximation theory; Markov chain; State space; Algorithm; Markov chain Monte Carlo; Monte Carlo method; Mathematical optimization; Theoretical computer science; Mathematics; Bayesian probability; Artificial intelligence; Discrete mathematics; Machine learning; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.005637175,0.000895943,0.001332611,0.001273206,0.0008541711,0.002039418,0.002709878,0.002437302,0.003734318],"category_scores_gemma":[0.02510862,0.0008137174,0.001264966,0.001510794,0.001743607,0.003205083,0.003120949,0.004161898,0.00120269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002287584,"about_ca_system_score_gemma":0.002053801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004132897,"about_ca_topic_score_gemma":0.003825865,"domain_scores_codex":[0.9968743,0.001599448,0.0001347061,0.0003350447,0.0008340928,0.0002223034],"domain_scores_gemma":[0.9887605,0.008674226,0.0004817804,0.0009276083,0.0009007201,0.0002552459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001034368,0.00005607985,0.0007538682,0.0001031081,0.0000420733,0.00009071995,0.0001790042,0.6720963,0.0010375,0.2730936,0.001464989,0.05097943],"study_design_scores_gemma":[0.000005343663,0.000005848366,0.00001710377,0.000007073055,0.000002314886,0.000009907834,0.00000464122,0.9649646,0.0001324721,0.03439314,0.0004537505,0.000003746457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001427222,0.00004384259,0.9979162,0.00007173885,0.00001080448,0.00001424581,0.00001194068,0.0001119515,0.0003921965],"genre_scores_gemma":[0.1412705,0.0002453207,0.8553529,0.0001642665,0.00006643299,0.0002793761,0.0001963629,0.0002251125,0.002199614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005637175,"threshold_uncertainty_score":0.02981257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05964424766372872,"score_gpt":0.3672619673111026,"score_spread":0.3076177196473739,"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."}}