{"id":"W2051336893","doi":"10.1109/icc.2010.5501926","title":"Relay Selection and Max-Min Resource Allocation for Multi-Source OFDM-Based Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Subcarrier; Computer science; Selection (genetic algorithm); Multiplexing; Resource allocation; Block (permutation group theory); Relay channel; Channel (broadcasting); Synchronization (alternating current); Computer network; Power (physics); Mathematical optimization; Telecommunications; 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.001384682,0.0005572586,0.0007993772,0.0005568389,0.0004290113,0.000602293,0.001007432,0.0005479032,0.001042758],"category_scores_gemma":[0.003478469,0.0002963891,0.0002730552,0.0008121762,0.0007107591,0.001067511,0.0006317252,0.0003009395,0.0001281264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005117,"about_ca_system_score_gemma":0.0004696493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001848912,"about_ca_topic_score_gemma":0.001827201,"domain_scores_codex":[0.9994611,0.0003194223,0.00001805123,0.00006038207,0.00006655738,0.00007437683],"domain_scores_gemma":[0.9983051,0.001376133,0.0001325741,0.00007584337,0.00007359508,0.00003682154],"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.0001637498,0.00002666262,0.00037925,0.00003833293,0.00002386036,0.00006855111,0.00005371558,0.9723103,0.001101827,0.01055923,0.0004680733,0.01480654],"study_design_scores_gemma":[0.00001160853,0.00002284485,0.00006878451,0.000002421106,0.000004648135,0.00001819322,0.00001225524,0.9925736,0.0004043076,0.006722127,0.0001556016,0.000003642332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1247303,0.0006955341,0.8704638,0.0003193541,0.00002266422,0.00005797233,0.0001029412,0.0001512289,0.003456223],"genre_scores_gemma":[0.94398,0.0002442746,0.0546029,0.00003923975,0.00001717239,0.00006467326,0.0000384335,0.0000169157,0.000996311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001848912,"threshold_uncertainty_score":0.007322967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03512467170120809,"score_gpt":0.2841571001624159,"score_spread":0.2490324284612078,"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."}}