{"id":"W2128221467","doi":"10.1109/ccece.2007.163","title":"Complexity Analysis of Optimal Stationary Call Admission Policy and Fixed Set Partitioning Policy for OVSF-CDMA Cellular Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Call Admission Control; Partition (number theory); Code division multiple access; Computer network; Scope (computer science); Set (abstract data type); Computational complexity theory; Computation; Distributed computing; Telecommunications; Algorithm; Mathematics","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.001224103,0.0001172208,0.0002842315,0.000897288,0.0002594086,0.0001310213,0.000700523,0.00007232703,0.00001327671],"category_scores_gemma":[0.0002089232,0.0001090422,0.00009085752,0.002177459,0.000131131,0.0003017537,0.0004332223,0.0001087368,0.000001883303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232163,"about_ca_system_score_gemma":0.0002651844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001963166,"about_ca_topic_score_gemma":0.0001359915,"domain_scores_codex":[0.9982762,0.0001784254,0.0004727046,0.000295406,0.0004018411,0.0003754141],"domain_scores_gemma":[0.9976555,0.0008301329,0.0001783294,0.000732529,0.000365156,0.0002383266],"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.00007353258,0.00016597,0.004440107,0.0001233166,0.0004299309,0.000003966361,0.001716569,0.09434479,0.003617386,0.8850688,0.001611678,0.008403901],"study_design_scores_gemma":[0.0002967429,0.00006480053,0.01399894,0.00001993856,0.00002480125,0.000002109104,0.0001236752,0.9820892,0.000994913,0.0005652368,0.001697615,0.0001219808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07133465,0.0001696505,0.9255045,0.001549683,0.00002279047,0.000320254,0.00004064181,0.00007181906,0.0009860008],"genre_scores_gemma":[0.9296259,0.00003354788,0.06955498,0.00009265207,0.00008374567,0.00002265508,0.0001321904,0.000008091271,0.0004462796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8877444,"threshold_uncertainty_score":0.4446612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08205759907706993,"score_gpt":0.3780120681752338,"score_spread":0.2959544690981639,"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."}}