{"id":"W131771944","doi":"","title":"A Markovian model for dynamic and constrained resource allocation problems","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Mathematical optimization; Resource allocation; Markov decision process; Markov process; Constraint (computer-aided design); Dimension (graph theory); Sequence (biology); State space; Stochastic modelling; Constraint satisfaction; Artificial intelligence; Mathematics; Probabilistic logic","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003438745,0.00006559915,0.00005849323,0.00008464712,0.00008557596,0.00006989297,0.00009518846,0.00004147729,0.000007293817],"category_scores_gemma":[0.00002284895,0.00006290252,0.0000192157,0.0001126128,0.00003978049,0.0002046763,0.00002777224,0.00003423686,0.000001364104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000254252,"about_ca_system_score_gemma":0.000037234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004365888,"about_ca_topic_score_gemma":0.0001740759,"domain_scores_codex":[0.9994203,0.000007699361,0.0001503067,0.0002013096,0.0000786765,0.0001416442],"domain_scores_gemma":[0.999637,0.00006462929,0.00004349242,0.0001344466,0.00005543264,0.00006500012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001722832,0.00003111947,0.0003382874,0.00003293438,0.00001274475,6.892819e-7,0.001140857,0.02358631,0.001912514,0.2785562,0.0003247017,0.6940464],"study_design_scores_gemma":[0.0003322006,0.00002022347,0.0009096311,0.000005359697,0.000002286167,0.00001175159,0.0000459414,0.9955257,0.00005567911,0.002530226,0.000477065,0.00008398308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001213006,0.00000981116,0.9913046,0.001742272,0.00003025682,0.0003114976,0.000001462751,0.0001414425,0.005245598],"genre_scores_gemma":[0.6747332,0.000003542637,0.3237545,0.0003476494,0.000004768955,0.000008746148,0.000006179911,0.000003592576,0.001137814],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9719393,"threshold_uncertainty_score":0.256509,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01197468331010438,"score_gpt":0.2422730582134501,"score_spread":0.2302983749033457,"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."}}