{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003630253,0.0009219426,0.001686691,0.000790146,0.001156144,0.003244841,0.001309958,0.001314783,0.003334984],"category_scores_gemma":[0.02343462,0.000627423,0.0007232591,0.0007789733,0.00164229,0.003433802,0.001506803,0.002301485,0.0002245921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005906501,"about_ca_system_score_gemma":0.00411678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006828468,"about_ca_topic_score_gemma":0.004243295,"domain_scores_codex":[0.9962347,0.001518612,0.0001175863,0.0004428034,0.0008141438,0.0008722381],"domain_scores_gemma":[0.9662968,0.02948356,0.001716756,0.0009422499,0.001032748,0.0005280543],"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.0003442022,0.0001014443,0.001334884,0.00007717135,0.00004233657,0.0000711473,0.00009846852,0.9533155,0.001333789,0.03250474,0.001221972,0.009554415],"study_design_scores_gemma":[0.00001575152,0.00001401669,0.000162284,0.00000324259,0.000005022925,0.000009735384,0.00002229867,0.9910472,0.0001794318,0.0084747,0.00006138915,0.00000485495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4414252,0.0009535518,0.5403894,0.003693956,0.0001216834,0.0002804036,0.000495336,0.0005429981,0.01209761],"genre_scores_gemma":[0.9664423,0.0002335078,0.03153989,0.000133144,0.00007442667,0.0001386032,0.0002029312,0.00006812037,0.001167069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006828468,"threshold_uncertainty_score":0.04285491,"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."}}