{"id":"W2131782986","doi":"10.1109/wcnc.2008.522","title":"A Maximum-Throughput Call Admission Control Policy for CDMA Beamforming Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Quality of service; Computer science; Throughput; Physical layer; Beamforming; Admission control; Computer network; Markov process; Code division multiple access; Markov decision process; Blocking (statistics); Call Admission Control; Wireless network; Wireless; Telecommunications; 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.001683752,0.0007953857,0.0007862269,0.000567323,0.001040417,0.001289875,0.001334901,0.001083868,0.002088343],"category_scores_gemma":[0.005615173,0.0004113802,0.0003298237,0.0007782644,0.0009883803,0.001029309,0.0009240654,0.001338292,0.000375174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002175404,"about_ca_system_score_gemma":0.002617354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006649017,"about_ca_topic_score_gemma":0.004545835,"domain_scores_codex":[0.9985068,0.0005352494,0.000067121,0.0001565855,0.0004668243,0.0002673294],"domain_scores_gemma":[0.9982718,0.000973044,0.00020924,0.0001031084,0.0003277086,0.0001151192],"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.0002470938,0.0001180303,0.0007159188,0.0001014758,0.00003507631,0.0001517276,0.0001461018,0.8711346,0.01007939,0.06046897,0.002764656,0.05403694],"study_design_scores_gemma":[0.00001055336,0.00001645813,0.0000664071,0.000004118695,0.000004784149,0.00001880428,0.00000628624,0.9945009,0.0009071557,0.004119632,0.000337403,0.000007479498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02859631,0.0005505854,0.9655542,0.0004663896,0.00008848718,0.00007052263,0.00005184094,0.0004579347,0.004163757],"genre_scores_gemma":[0.9534079,0.0003415089,0.04441834,0.0001040376,0.00008560852,0.0001097807,0.00003351739,0.0000291343,0.00147024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006649017,"threshold_uncertainty_score":0.01578373,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04541503153022503,"score_gpt":0.3153849244424234,"score_spread":0.2699698929121984,"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."}}