{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003196461,0.0002714274,0.0002232376,0.00006481048,0.0001717738,0.0001073888,0.000193295,0.0001139597,0.00003463251],"category_scores_gemma":[0.000006073912,0.0001880195,0.00002697446,0.0007387282,0.00006574956,0.0002985259,0.00004053499,0.0003106185,0.00001209275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001234279,"about_ca_system_score_gemma":0.00001306047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009682084,"about_ca_topic_score_gemma":0.00000458143,"domain_scores_codex":[0.9986237,0.00008814207,0.0002425125,0.0002106993,0.000171546,0.0006633446],"domain_scores_gemma":[0.9993135,0.0002664545,0.00005253129,0.0002426012,0.00003695814,0.00008801083],"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.00006141474,0.00007900937,0.00677404,0.00001039608,0.00002471037,0.000001497382,0.0001067876,0.9901739,0.001329932,0.0001944568,0.0004955571,0.0007483356],"study_design_scores_gemma":[0.0004489264,0.00004890627,0.001090172,0.00007047535,0.000007428404,0.000002418787,0.00005296363,0.9944077,0.003485104,0.000004904688,0.00011027,0.0002707152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4698577,0.000812654,0.5286253,0.00002640358,0.0001264047,0.0002202118,9.191877e-7,0.0001744421,0.0001560255],"genre_scores_gemma":[0.9833446,0.00015327,0.01588362,0.0001591091,0.0001321611,0.00009580486,0.0000194303,0.00009181909,0.0001202247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5134869,"threshold_uncertainty_score":0.7667214,"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."}}