{"id":"W1852912980","doi":"10.1109/ccece.1995.528067","title":"A simple upper bound for blocking probabilities in large multi-rate loss networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Blocking (statistics); Upper and lower bounds; Computer science; Computation; Gaussian; Simple (philosophy); Routing (electronic design automation); Laplace transform; Mathematical optimization; Algorithm; Topology (electrical circuits); Mathematics; 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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006415113,0.0001808284,0.000243356,0.000197966,0.0002258103,0.0002172283,0.0001820759,0.00006776294,0.0009570064],"category_scores_gemma":[0.0002864753,0.0001639807,0.0001211618,0.0004712323,0.00005006791,0.0009273293,0.0001232728,0.0001109875,0.00007454905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004121995,"about_ca_system_score_gemma":0.000002638526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001009582,"about_ca_topic_score_gemma":0.001308586,"domain_scores_codex":[0.9987586,0.00001651829,0.0003053157,0.0003278342,0.00008461629,0.0005070755],"domain_scores_gemma":[0.9993734,0.0001498823,0.0001208265,0.0002475418,0.00009862122,0.000009663107],"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.0001946767,0.001133979,0.263294,0.0006687184,0.0002145125,0.00003877364,0.0006157498,0.2714809,0.0001376901,0.4503946,0.005168503,0.006657943],"study_design_scores_gemma":[0.0009592448,0.000004664239,0.0009015779,0.00002902198,0.00004096571,3.66548e-7,0.00037181,0.9299874,0.00001314482,0.03367083,0.03374286,0.0002781003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7840502,0.0003049678,0.206536,0.0008918346,0.0002488598,0.001075354,0.000005805122,0.0004646229,0.006422315],"genre_scores_gemma":[0.993432,0.000006021599,0.001131416,0.001632327,0.0004543587,0.00009245434,0.00001975362,0.00003569932,0.003195954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6585066,"threshold_uncertainty_score":0.9999563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02302673483871203,"score_gpt":0.24719529561314,"score_spread":0.224168560774428,"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."}}