{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004803058,0.0001490517,0.0002410591,0.0001898977,0.0004879387,0.000149242,0.001889952,0.000100157,0.000007604917],"category_scores_gemma":[0.0001795594,0.0001230443,0.00009521497,0.0005346676,0.00006910809,0.0005322517,0.0004192079,0.0001789234,0.00005449644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001553201,"about_ca_system_score_gemma":0.0004373718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004988302,"about_ca_topic_score_gemma":0.00001367787,"domain_scores_codex":[0.9981849,0.0001338596,0.0003520511,0.0003454196,0.0004337459,0.0005500264],"domain_scores_gemma":[0.9975823,0.0005053381,0.00009849787,0.00129302,0.0002624852,0.0002583233],"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.0001588765,0.0005378555,0.001425644,0.0002331248,0.0001649869,0.00004913225,0.002971168,0.03145108,0.003155546,0.704087,0.1018486,0.1539171],"study_design_scores_gemma":[0.001137016,0.0001071832,0.0002043073,0.00003681425,0.000001815687,0.00009125507,0.00002172546,0.9006377,0.0002456156,0.0007446504,0.0965817,0.0001901446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001459845,0.0004229639,0.9860015,0.005162609,0.0001459287,0.0007830391,0.000003373732,0.000289439,0.005731334],"genre_scores_gemma":[0.9339159,0.0001634084,0.06011723,0.0005844796,0.0002863278,0.0002423425,0.000005352452,0.00002030681,0.004664668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.932456,"threshold_uncertainty_score":0.5017601,"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."}}