{"id":"W4387185322","doi":"10.3233/faia230293","title":"Cache-Efficient Dynamic Programming MDP Solver","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Memory hierarchy; Solver; Parallel computing; Hierarchy; State (computer science); Domain (mathematical analysis); Dynamic programming; Cache algorithms; Cache-oblivious algorithm; Component (thermodynamics); CPU cache; Distributed computing; Algorithm; Programming language; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005883672,0.0003033831,0.0003267404,0.0004795975,0.0002330594,0.0001982863,0.0009194503,0.0003043096,0.000008914255],"category_scores_gemma":[0.00003767058,0.0003337159,0.00009698515,0.000391644,0.0002930777,0.0001507387,0.0002753478,0.0004810755,0.0002539469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000162578,"about_ca_system_score_gemma":0.00008808859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387398,"about_ca_topic_score_gemma":0.00002854863,"domain_scores_codex":[0.9977902,0.0000279462,0.0006645505,0.0008353294,0.0003067815,0.0003752189],"domain_scores_gemma":[0.99862,0.00006823196,0.0002512011,0.0008475971,0.00009967809,0.0001133028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000188796,0.0000217615,0.000003372847,0.00001836693,0.000008539423,0.000001788528,0.0001718339,0.0004851291,0.000006883727,0.5249813,0.0001174608,0.4741817],"study_design_scores_gemma":[0.00001794616,0.00003942752,0.00002118946,0.0001090607,0.00002443303,0.000005137207,0.0002188091,0.364887,0.000302177,0.5466388,0.08720221,0.0005338906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000005930049,0.0005154466,0.9811285,0.0002358279,0.0007333159,0.001060819,0.00001552328,0.0002673874,0.01603727],"genre_scores_gemma":[0.002349891,0.001141667,0.9472523,0.0001082211,0.0002284686,0.001083502,0.00007315169,0.00009658089,0.04766618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4736478,"threshold_uncertainty_score":0.9999115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05499757586910129,"score_gpt":0.3088359084503276,"score_spread":0.2538383325812263,"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."}}