{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002958799,0.002042453,0.001870856,0.001251109,0.001569974,0.00328782,0.003631327,0.002977139,0.006479355],"category_scores_gemma":[0.005178656,0.001344594,0.001636709,0.001790194,0.003067793,0.005450197,0.002436855,0.002724963,0.001004843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004919342,"about_ca_system_score_gemma":0.003179691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01108997,"about_ca_topic_score_gemma":0.01072504,"domain_scores_codex":[0.9969485,0.00148861,0.00009524367,0.0005523329,0.0003916817,0.0005235685],"domain_scores_gemma":[0.9977601,0.001395146,0.0002560328,0.0001032995,0.0002495869,0.000235864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005543987,0.0000869151,0.0003895502,0.0001587491,0.00004680551,0.0004019661,0.0003225699,0.4114634,0.001704918,0.5747719,0.00242919,0.008168587],"study_design_scores_gemma":[0.00002292271,0.00004720467,0.0001323759,0.00001779698,0.00002646278,0.00006703847,0.00007728607,0.8885552,0.0001770608,0.1095297,0.001321267,0.00002559426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01646227,0.0008936104,0.9664533,0.001168012,0.00007680739,0.000125808,0.0001370969,0.000119831,0.01456319],"genre_scores_gemma":[0.8104938,0.002742337,0.1697008,0.0003314437,0.0003349505,0.0004440552,0.0001986908,0.0000999545,0.01565394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01108997,"threshold_uncertainty_score":0.03569245,"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."}}