{"id":"W32549655","doi":"10.4103/iju.iju_84_20","title":"Solving a stochastic queueing design and control problem with constraint programming","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Mathematical optimization; Constraint programming; Constraint (computer-aided design); Stochastic programming; Decomposition; Benders' decomposition; Variety (cybernetics); Constraint satisfaction; Operations research; Mathematics; Artificial intelligence; Computer network","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.00118622,0.0001768815,0.0001509992,0.0002430312,0.0002647054,0.0003923448,0.00022772,0.00007241316,0.0000474982],"category_scores_gemma":[0.0002132476,0.0001602532,0.00002527986,0.0003684686,0.0002206406,0.0004006771,0.00003248174,0.0002209505,0.00002476849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009093934,"about_ca_system_score_gemma":0.0003586957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001607535,"about_ca_topic_score_gemma":0.00007369498,"domain_scores_codex":[0.9982493,0.00006993715,0.000376195,0.0004330503,0.0005569634,0.0003145424],"domain_scores_gemma":[0.9983531,0.0005792431,0.0001607474,0.0001241327,0.0006434471,0.0001393804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005062202,0.00003612407,0.00003352103,0.000004039177,0.00001061633,0.000006262332,0.0003223201,0.02407938,0.0005914552,0.6041545,0.000001796041,0.3707094],"study_design_scores_gemma":[0.0001301717,0.0002895451,0.000422806,0.0001161616,0.000007738885,0.00006256757,0.0003531795,0.9420835,0.003177702,0.05301795,0.00002552209,0.0003131896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006572545,0.0000102252,0.9958259,0.00108959,0.00008121823,0.0005518762,0.000001690343,0.0001537803,0.001628433],"genre_scores_gemma":[0.7935084,0.000002055805,0.2061797,0.0002354048,0.00003114197,0.00002334911,0.000001452743,0.000006373325,0.00001221529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9180041,"threshold_uncertainty_score":0.6534934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06487848277850274,"score_gpt":0.3006697614736803,"score_spread":0.2357912786951776,"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."}}