{"id":"W2104242807","doi":"10.1109/twc.2012.031212.101702","title":"Resource Allocation via Linear Programming for Fractional Cooperation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Computer science; Relay; Mathematical optimization; Resource allocation; Linear programming; Optimization problem; Demodulation; Low-density parity-check code; Decoding methods; Computer network; Telecommunications; Algorithm; Mathematics; Channel (broadcasting)","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.00168169,0.001298582,0.00118489,0.0005297624,0.0004756625,0.001828003,0.0007734995,0.001345058,0.002554548],"category_scores_gemma":[0.003426883,0.0006421932,0.000555857,0.001067653,0.001512736,0.001166942,0.001105153,0.00135941,0.0003074331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001930619,"about_ca_system_score_gemma":0.001588612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003340074,"about_ca_topic_score_gemma":0.002576777,"domain_scores_codex":[0.9991838,0.0004137794,0.00001763654,0.0001043545,0.0001481754,0.0001322056],"domain_scores_gemma":[0.9986217,0.001079503,0.0001143955,0.00004337878,0.00008770948,0.0000532396],"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.00003579025,0.0000293794,0.00007750716,0.00004898372,0.00001941658,0.00007159673,0.00004488453,0.9247087,0.0004142825,0.06871829,0.00101641,0.004814732],"study_design_scores_gemma":[0.000008044623,0.00001261834,0.00001602844,0.000006110321,0.000003615071,0.00000884485,0.00001149779,0.9779949,0.00008639288,0.021376,0.0004726151,0.000003362156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01732025,0.0008519838,0.9669275,0.0007602079,0.00008119508,0.00004955283,0.00008149942,0.0001197833,0.01380792],"genre_scores_gemma":[0.8223648,0.001349043,0.1599575,0.0005620384,0.0001295355,0.0004306055,0.0001397232,0.0001451233,0.01492172],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003340074,"threshold_uncertainty_score":0.01400775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06050846789202001,"score_gpt":0.3150134039708821,"score_spread":0.254504936078862,"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."}}