{"id":"W2042852713","doi":"10.1109/glocom.2009.5426211","title":"Greedy Sub-Channel Redistribution Routing Scheme in Multi-Hop Wireless OFDMA Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Hop (telecommunications); Equal-cost multi-path routing; Dijkstra's algorithm; Private Network-to-Network Interface; Dynamic Source Routing; Shortest path problem; Distributed computing; Routing (electronic design automation); Routing protocol; Theoretical computer science; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.0006225873,0.000427651,0.0007615533,0.0006693284,0.0007188219,0.0004130987,0.001230474,0.0004255206,0.0007794998],"category_scores_gemma":[0.0009540951,0.0002128398,0.000377968,0.0007191755,0.0006280249,0.001009789,0.0009198069,0.0004262272,0.0002613585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005719098,"about_ca_system_score_gemma":0.0006629571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000921154,"about_ca_topic_score_gemma":0.001341239,"domain_scores_codex":[0.999472,0.0002130018,0.00002722756,0.00007799142,0.0001281796,0.00008160571],"domain_scores_gemma":[0.9994305,0.000180072,0.00008670722,0.0001617817,0.00009822198,0.00004276143],"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.0008488439,0.0001659278,0.001142552,0.0003203129,0.0001704798,0.0005137066,0.0004485078,0.4866255,0.07788455,0.07560582,0.007834635,0.3484393],"study_design_scores_gemma":[0.00009786613,0.0004253787,0.0004548163,0.0000191728,0.00005963269,0.0005512212,0.0001106654,0.9532787,0.0139328,0.02164658,0.009349921,0.00007325048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05109853,0.001299033,0.9443445,0.0003281997,0.0001597782,0.00009608791,0.00005962292,0.0006137981,0.002000444],"genre_scores_gemma":[0.7922438,0.0007531372,0.2041694,0.0001903508,0.00008638192,0.0001740191,0.0001357561,0.00005900062,0.002188265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001230474,"threshold_uncertainty_score":0.004149497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04830134469215322,"score_gpt":0.2874405111904723,"score_spread":0.239139166498319,"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."}}