{"id":"W1992872735","doi":"10.1016/s0895-7177(02)00118-8","title":"An optimal two-stage graphical search planning procedure for submerged targets","year":2002,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Graphical model; Constraint (computer-aided design); Computer science; Mathematical optimization; Code (set theory); Stage (stratigraphy); Bayesian probability; Algorithm; Graphical user interface; Source code; Search algorithm; Mathematics; Artificial intelligence; Programming language","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.000561008,0.0009797553,0.00110069,0.0008969897,0.0004595882,0.0008373979,0.00133524,0.001296877,0.006543098],"category_scores_gemma":[0.002388906,0.0008270883,0.0009100279,0.0008003119,0.0006353359,0.001076835,0.001339008,0.0008819934,0.0005718935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008029917,"about_ca_system_score_gemma":0.00196768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009888181,"about_ca_topic_score_gemma":0.01179255,"domain_scores_codex":[0.9996178,0.0001250854,0.00001705841,0.00008739707,0.00009221616,0.00006039638],"domain_scores_gemma":[0.9991642,0.0005758264,0.00005862724,0.000057441,0.00009291462,0.00005100375],"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.0002105606,0.00004728574,0.0001957677,0.0001028227,0.00002831875,0.0001022038,0.00007214521,0.8981033,0.003847323,0.009735987,0.001254474,0.08629988],"study_design_scores_gemma":[0.00002698457,0.00003474151,0.00007345554,0.000004006903,0.000008647599,0.00001383569,0.000006247336,0.9937342,0.0008254588,0.00503513,0.0002290138,0.000008271293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007851149,0.00003742875,0.9899043,0.00006206246,0.00001009846,0.00004973569,0.00007426034,0.0005307271,0.001480212],"genre_scores_gemma":[0.4210305,0.00007686704,0.57533,0.00007471647,0.00001229904,0.0002453648,0.0002393215,0.0001700175,0.002820855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009888181,"threshold_uncertainty_score":0.02188885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03159555799745902,"score_gpt":0.2463338443902232,"score_spread":0.2147382863927642,"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."}}