{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001880167,0.001122287,0.001604304,0.0008367016,0.0008860209,0.002458812,0.002817257,0.00235856,0.005968547],"category_scores_gemma":[0.004818413,0.0009035256,0.0009790759,0.001673567,0.002057197,0.002945391,0.001684366,0.002777064,0.0009328373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002676614,"about_ca_system_score_gemma":0.003121736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02058792,"about_ca_topic_score_gemma":0.02134715,"domain_scores_codex":[0.9983284,0.0005887988,0.00008584921,0.0002880233,0.0003868806,0.0003221423],"domain_scores_gemma":[0.9969577,0.002108176,0.0003274914,0.0001425349,0.0002394436,0.0002246263],"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.00006386403,0.00004591687,0.0003349664,0.00007359128,0.00003514591,0.0001582536,0.0001091243,0.6189962,0.0005959655,0.3718616,0.002533635,0.005191799],"study_design_scores_gemma":[0.00002605179,0.00001590905,0.00008883067,0.00001022562,0.000009086359,0.00002633371,0.00001282269,0.879187,0.00006649647,0.1187321,0.001811451,0.00001363121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01871318,0.0009396772,0.9649193,0.002035631,0.0001400829,0.00009331523,0.0007252865,0.0003042158,0.01212933],"genre_scores_gemma":[0.8217857,0.002885563,0.1337638,0.0006989749,0.0004828623,0.0009101431,0.001418256,0.0002098849,0.03784475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02058792,"threshold_uncertainty_score":0.04093617,"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."}}