{"id":"W2966589507","doi":"10.22215/etd/2013-10385","title":"Towards Efficient and Fair Radio Resource Allocation Schemes for Interference-Limited Celluar Networks","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"","keywords":"Subgradient method; Mathematical optimization; Resource allocation; Computer science; Optimization problem; Maximization; Interference (communication); Convex optimization; Max-min fairness; Cellular network; Mathematics; Regular polygon; Computer network","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.003505287,0.0009242592,0.001104868,0.0006392247,0.0006536143,0.00193267,0.001685825,0.001063385,0.001170292],"category_scores_gemma":[0.007784752,0.0005473301,0.0005716984,0.0008481462,0.001515604,0.002039457,0.001943469,0.001997157,0.0004096319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001738471,"about_ca_system_score_gemma":0.002277198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001595893,"about_ca_topic_score_gemma":0.001573295,"domain_scores_codex":[0.9988833,0.0004273914,0.00004918276,0.0001369751,0.0003479243,0.0001551798],"domain_scores_gemma":[0.9985678,0.0008070625,0.0001688835,0.000159988,0.0002357217,0.00006047107],"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.00007334311,0.00009634576,0.0002701372,0.0001037376,0.0000327111,0.0000644996,0.0002326281,0.641647,0.006779666,0.2964423,0.002081029,0.05217662],"study_design_scores_gemma":[0.00001181002,0.00002030367,0.00005099108,0.00001765621,0.000006130755,0.00001574269,0.00002735198,0.9467835,0.0009608854,0.0506071,0.001492463,0.000006077032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009098268,0.0004030286,0.9876963,0.0002336482,0.00003950523,0.00006553736,0.0000151556,0.00005949085,0.002388953],"genre_scores_gemma":[0.4191761,0.002198871,0.5730608,0.0003116504,0.0002054927,0.0003608152,0.00006321589,0.00008390533,0.004539205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003505287,"threshold_uncertainty_score":0.01853794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0073414992046564,"score_gpt":0.2156044238632296,"score_spread":0.2082629246585732,"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."}}