{"id":"W2070005935","doi":"10.1155/2011/184685","title":"Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Johns Hopkins University","keywords":"Throughput; Computer science; Bandwidth (computing); Maximum throughput scheduling; Wireless network; Code rate; Fading; Computer network; Wireless; Maximization; Power (physics); Mathematical optimization; Algorithm; Mathematics; Quality of service; Telecommunications; Channel (broadcasting); Decoding methods","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.002221158,0.001117819,0.001224669,0.0004645335,0.0006328748,0.001384857,0.001203265,0.0008970244,0.001008046],"category_scores_gemma":[0.004881058,0.000390867,0.0004031728,0.0009047558,0.001822141,0.001240832,0.001391512,0.0008660718,0.0002054382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00127671,"about_ca_system_score_gemma":0.0008524672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009602431,"about_ca_topic_score_gemma":0.0009838064,"domain_scores_codex":[0.9986259,0.0008193319,0.00003101515,0.0001401559,0.0002326644,0.0001509831],"domain_scores_gemma":[0.9971358,0.002132492,0.0002253574,0.000149148,0.0002231058,0.0001341579],"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.00009596497,0.00003162121,0.000218939,0.0001051246,0.00003577717,0.0001906536,0.0001225817,0.9274284,0.003196826,0.0588677,0.0009291275,0.008777382],"study_design_scores_gemma":[0.00001033489,0.00002481026,0.00004390485,0.000004237425,0.000006147633,0.00002131625,0.0000164894,0.9809667,0.0003021255,0.01836455,0.0002347113,0.000004620614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05125728,0.001107121,0.942106,0.0004076936,0.00006043546,0.00003606134,0.0000270477,0.0001795659,0.004818818],"genre_scores_gemma":[0.9775456,0.0005088982,0.02022204,0.00005461133,0.00005555731,0.00008029053,0.00002316716,0.00003166176,0.00147827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002221158,"threshold_uncertainty_score":0.0117467,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711399990036444,"score_gpt":0.3000242043990943,"score_spread":0.2829102044987299,"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."}}