{"id":"W2026540849","doi":"10.1007/s11276-013-0546-4","title":"Fair resource allocation and DF relay selection for multiuser OFDMA-based cooperative networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Relay; Mathematical optimization; Subcarrier; Resource allocation; Selection (genetic algorithm); Optimization problem; Joint (building); Iterative method; Simple (philosophy); Power (physics); Algorithm; Orthogonal frequency-division multiplexing; Computer network; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002876215,0.000629242,0.001193253,0.0007256109,0.001188037,0.001295097,0.001513308,0.0008040169,0.001525712],"category_scores_gemma":[0.00755349,0.0004327823,0.0003577841,0.0009767383,0.001177927,0.001256772,0.001193,0.0005778468,0.0002349606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001344216,"about_ca_system_score_gemma":0.001624344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004848188,"about_ca_topic_score_gemma":0.009002893,"domain_scores_codex":[0.9989246,0.0004270045,0.00004254933,0.0001649557,0.0002348517,0.0002060643],"domain_scores_gemma":[0.99628,0.002917594,0.0001610918,0.0002418114,0.0003010166,0.00009845038],"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.0007971814,0.0001999911,0.00133398,0.0001040919,0.0001080715,0.000260337,0.0004433436,0.7889735,0.01085771,0.09291007,0.003080917,0.1009307],"study_design_scores_gemma":[0.00002972368,0.00004609871,0.000127498,0.000003349046,0.00001565284,0.00003934092,0.00002274562,0.9812144,0.0008092023,0.01735066,0.0003313639,0.00000999811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05472055,0.0006563382,0.9413954,0.0002007572,0.0000879272,0.00007211597,0.0000651485,0.0001198481,0.002681813],"genre_scores_gemma":[0.9471015,0.0002115381,0.05052967,0.00005354594,0.00008346733,0.00009618748,0.00003070316,0.00001835276,0.001875142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004848188,"threshold_uncertainty_score":0.01521111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.017391700644768,"score_gpt":0.2446251056722959,"score_spread":0.2272334050275279,"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."}}