{"id":"W6989303635","doi":"","title":"An AO* based exact algorithm for the Canadian traveler problem","year":2016,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Markov process; Vertex (graph theory); Time complexity; Markov decision process; Node (physics); Graph; Graph traversal; Markov chain","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007274457,0.0009068237,0.0007812335,0.0009281575,0.0009611826,0.001063074,0.001995601,0.001048112,0.01021448],"category_scores_gemma":[0.002710644,0.0004654324,0.0006908792,0.001663448,0.0006844414,0.001285398,0.001502887,0.001250023,0.001032826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002951256,"about_ca_system_score_gemma":0.009657461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1376955,"about_ca_topic_score_gemma":0.1800288,"domain_scores_codex":[0.9993908,0.00007792383,0.00002526706,0.0001599727,0.0001642231,0.000181777],"domain_scores_gemma":[0.9992129,0.0003992332,0.00006636384,0.0001068346,0.0001473199,0.00006730839],"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.0002532235,0.0001937814,0.00120673,0.0001434953,0.00003892378,0.00008168743,0.00008988156,0.6603364,0.001286905,0.04527735,0.01912987,0.2719618],"study_design_scores_gemma":[0.00006814676,0.00002570173,0.0001562109,0.000008771016,0.000007782927,0.00002138119,0.00003241671,0.9797164,0.0003585131,0.01615508,0.003441698,0.000007850585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04220221,0.0003961222,0.921165,0.001194086,0.000143529,0.000460992,0.001005403,0.003877535,0.02955509],"genre_scores_gemma":[0.2781217,0.0002064878,0.7100825,0.0003700173,0.00004085659,0.0003573978,0.001497709,0.0003649031,0.008958529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1376955,"threshold_uncertainty_score":0.273788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05115286638250015,"score_gpt":0.2776908501656091,"score_spread":0.2265379837831089,"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."}}