{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003983333,0.00159438,0.001860654,0.0006527167,0.0007823257,0.002529226,0.001630715,0.002375556,0.003115293],"category_scores_gemma":[0.007023085,0.001163986,0.001485616,0.001341355,0.001466123,0.001138123,0.001414591,0.00223903,0.0002839191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002183989,"about_ca_system_score_gemma":0.004318787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01568699,"about_ca_topic_score_gemma":0.008065145,"domain_scores_codex":[0.9974759,0.001069179,0.0001188473,0.0005124759,0.0004466477,0.0003770549],"domain_scores_gemma":[0.9929121,0.005859941,0.0003979063,0.000147252,0.0004473777,0.0002353615],"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.00005602036,0.0000353095,0.0001419047,0.00006534551,0.00003441267,0.00004925783,0.00002478628,0.9827663,0.0004004338,0.009025778,0.0003802076,0.007020298],"study_design_scores_gemma":[0.00002787918,0.00002405034,0.00003142693,0.000004378879,0.000007748852,0.000006108319,0.000007245145,0.9953877,0.0001747436,0.00405654,0.0002671443,0.000004960149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01477389,0.000229525,0.9813719,0.0004917127,0.00005710321,0.0001109111,0.00011257,0.0001859338,0.002666533],"genre_scores_gemma":[0.5640666,0.0006757224,0.4285819,0.0004019955,0.0001849522,0.0008146184,0.0004335955,0.0001261919,0.004714375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01568699,"threshold_uncertainty_score":0.03119135,"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."}}