{"id":"W2100889655","doi":"10.1002/wcm.2251","title":"A hierarchical framework of dynamic relay selection for mobile users and profit maximization for service providers in wireless relay networks","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Relay; Computer science; Computer network; Wireless; Profit maximization; Service provider; Selection (genetic algorithm); Maximization; Telecommunications; Profit (economics); Service (business); Business; Mathematical optimization; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001013073,0.000200696,0.0003295715,0.0001798352,0.0006492638,0.0001234818,0.0008571589,0.000169683,7.193009e-7],"category_scores_gemma":[0.00006233121,0.0002129308,0.00005586671,0.0008127731,0.000139206,0.0004944976,0.0008525889,0.0003941803,2.318752e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008493425,"about_ca_system_score_gemma":0.00006607507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002440634,"about_ca_topic_score_gemma":0.0001355978,"domain_scores_codex":[0.9982924,0.0003065708,0.0005614656,0.0003438882,0.0001054185,0.000390225],"domain_scores_gemma":[0.9967426,0.001572436,0.0003009882,0.0009669511,0.0003069628,0.0001100658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007630688,0.0004333522,0.0285647,0.0003638726,0.00007445802,7.99798e-8,0.01402121,0.03699372,0.001550955,0.138341,0.00004223463,0.7795381],"study_design_scores_gemma":[0.0005863315,0.0001337808,0.003265721,0.0003042727,0.00001586878,0.000006734382,0.000354297,0.9939599,0.0000595374,0.0002392558,0.0008467933,0.0002275061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3609803,0.002465202,0.6343736,0.0005030077,0.00007581319,0.001509871,0.000003109463,0.00007356793,0.00001549545],"genre_scores_gemma":[0.8383599,0.002329664,0.1582533,0.0001384648,0.00002775381,0.0008183469,0.00003896368,0.00002361508,0.00001001167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9569662,"threshold_uncertainty_score":0.8683064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02371301001121523,"score_gpt":0.3030787915883862,"score_spread":0.279365781577171,"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."}}