{"id":"W2063976404","doi":"10.1109/glocomw.2012.6477560","title":"Efficiently computable bounds on the rates achieved by a cross layer design with binary scheduling in generic OFDMA wireless networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Upper and lower bounds; Computer science; Wireless network; Binary number; Scheduling (production processes); Wireless; Rounding; Approximation algorithm; Mathematical optimization; Algorithm; Topology (electrical circuits); Computer network; Mathematics; Telecommunications; Combinatorics","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.005398642,0.001866678,0.001191115,0.0009418381,0.0006193662,0.002411273,0.001068455,0.001190093,0.002730351],"category_scores_gemma":[0.02456115,0.0006507306,0.0005415507,0.001116906,0.001731563,0.002570688,0.001779473,0.001810322,0.0004504716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001843178,"about_ca_system_score_gemma":0.001603229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471194,"about_ca_topic_score_gemma":0.001334417,"domain_scores_codex":[0.9976785,0.001008754,0.00008596383,0.0001956562,0.0006155742,0.0004155586],"domain_scores_gemma":[0.9899037,0.008049195,0.0006752577,0.0006258125,0.0005549898,0.0001911389],"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.0001421827,0.00004166118,0.0001934996,0.00008632817,0.00001380638,0.00003536959,0.00004571878,0.9481785,0.002330631,0.03814619,0.0005386334,0.01024752],"study_design_scores_gemma":[0.0000170849,0.00003853327,0.00007158543,0.00001865447,0.000005127338,0.00001288587,0.00001525724,0.9858735,0.001244407,0.01246221,0.0002336946,0.000007065026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09242974,0.0006905096,0.8951028,0.0004705023,0.00006216791,0.0000760432,0.0001391276,0.0002777706,0.01075142],"genre_scores_gemma":[0.8003198,0.0007708415,0.1964663,0.0001919576,0.00005271801,0.00027207,0.0001804138,0.0001413002,0.001604649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005398642,"threshold_uncertainty_score":0.0285511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01885348308858107,"score_gpt":0.2341088102411847,"score_spread":0.2152553271526037,"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."}}