{"id":"W2594146932","doi":"10.1139/cjfr-2016-0302","title":"A neuro-dynamic programming approach to the optimal stand management problem","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Forest Management and Policy","field":"Environmental Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University; Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Context (archaeology); Dynamic programming; Thinning; Stochastic programming; Computer science; Set (abstract data type); Forest management; Interval (graph theory); State variable; Operations research; Mathematical optimization; Forestry; Mathematics; Geography","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.001274759,0.0012373,0.001213591,0.0006690032,0.0005705813,0.001656345,0.001410341,0.001898755,0.003392471],"category_scores_gemma":[0.002098899,0.0007444989,0.0008322912,0.0009638425,0.00141426,0.001060926,0.001012295,0.002348113,0.0002730544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002380989,"about_ca_system_score_gemma":0.002936405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01687079,"about_ca_topic_score_gemma":0.01336905,"domain_scores_codex":[0.9994034,0.0002786345,0.000022779,0.0001223194,0.0001170823,0.00005576491],"domain_scores_gemma":[0.9991778,0.0005978559,0.00006699505,0.00001638534,0.00009287867,0.00004809539],"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.000009696668,0.00001818106,0.0000995215,0.00002976834,0.00001915418,0.00002948307,0.00001719391,0.9675393,0.00009578815,0.02665099,0.0004981998,0.004992729],"study_design_scores_gemma":[0.000008532518,0.00001713586,0.00005104666,0.000009769836,0.000005714766,0.000009230235,0.000009871839,0.9716054,0.00004724567,0.02743433,0.0007959337,0.000005772367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006996483,0.0008160525,0.97764,0.001419991,0.00008457137,0.00007123526,0.0001660449,0.00007679601,0.01272881],"genre_scores_gemma":[0.6048856,0.002254376,0.3755631,0.0007910421,0.0003585712,0.000772416,0.0002951151,0.00007980606,0.01499991],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01687079,"threshold_uncertainty_score":0.0335452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04232105293968922,"score_gpt":0.3144045405173599,"score_spread":0.2720834875776706,"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."}}