{"id":"W1576016125","doi":"10.1109/pacrim.2005.1517297","title":"Fast optimal radio resource allocation in OFDMA system based on branch-and-bound method","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Quality of service; Base station; Frequency-division multiple access; Resource allocation; Throughput; Transmission (telecommunications); Channel (broadcasting); Computational complexity theory; Mathematical optimization; Orthogonal frequency-division multiplexing; Constraint (computer-aided design); Channel allocation schemes; Algorithm; Computer network; Wireless; Mathematics; Telecommunications","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.001734271,0.0007991426,0.001762536,0.0007818297,0.000616454,0.001330801,0.0007814852,0.0009537671,0.00256497],"category_scores_gemma":[0.00266265,0.0004877982,0.0003504307,0.001050022,0.0008571816,0.001060424,0.0006535629,0.0008498588,0.0005271289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00099715,"about_ca_system_score_gemma":0.001940467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004303052,"about_ca_topic_score_gemma":0.003022107,"domain_scores_codex":[0.9990379,0.0004572146,0.00002572501,0.00007503077,0.0002784465,0.0001257057],"domain_scores_gemma":[0.9988695,0.00085115,0.00005857172,0.00003989939,0.0001519154,0.00002890433],"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.00008966841,0.00004341332,0.0002095358,0.00006547481,0.00002533777,0.0000304729,0.00004423079,0.9009102,0.001229256,0.02877027,0.001884006,0.06669819],"study_design_scores_gemma":[0.000009435817,0.000007244737,0.00001867255,0.000002736623,0.000001869669,0.000005606377,0.000002191606,0.9969962,0.0001433939,0.002606197,0.0002044075,0.000002129317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005979612,0.0004259751,0.9913136,0.0001134013,0.00002537054,0.00002164326,0.00001395271,0.0001294528,0.001976889],"genre_scores_gemma":[0.37193,0.00102862,0.6230282,0.0001683537,0.0001164447,0.0002939253,0.0001095458,0.0001040048,0.003220908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004303052,"threshold_uncertainty_score":0.009171844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005883136104817576,"score_gpt":0.221395465082969,"score_spread":0.2155123289781514,"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."}}