{"id":"W2312668963","doi":"10.1002/ett.3039","title":"Resource allocation and congestion control in clustered M2M communication using Q‐learning","year":2016,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Convergence (economics); Cluster analysis; Mathematical optimization; Rate of convergence; Core (optical fiber); Network congestion; Channel (broadcasting); Key (lock); Resource allocation; Artificial intelligence; Computer network; Mathematics; Telecommunications","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.002899843,0.0006290484,0.001130281,0.000594684,0.0008578892,0.0009106282,0.001541745,0.001025826,0.001515089],"category_scores_gemma":[0.006585344,0.0003836112,0.0004428401,0.0007631942,0.001117689,0.001162537,0.0009779022,0.0007920454,0.000197236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001233141,"about_ca_system_score_gemma":0.001482192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004592135,"about_ca_topic_score_gemma":0.002735018,"domain_scores_codex":[0.9987992,0.0005606809,0.00004626195,0.0002364172,0.0001962934,0.0001610077],"domain_scores_gemma":[0.9954011,0.003360726,0.0003441672,0.0002032671,0.0005586703,0.0001320505],"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.0001215491,0.00008966871,0.000488832,0.00004458231,0.00003510021,0.0000416567,0.00004890038,0.9636257,0.00112421,0.005644908,0.0005158724,0.02821906],"study_design_scores_gemma":[0.00000730261,0.00002149939,0.00004685213,0.000001619901,0.000002519062,0.000006003481,0.000004609987,0.9979436,0.000185874,0.001710267,0.00006776007,0.000002113809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03993618,0.0002790694,0.9579548,0.0002184321,0.00005069602,0.00006868696,0.00001586579,0.0002277446,0.001248505],"genre_scores_gemma":[0.9380197,0.00008347725,0.06071979,0.0001032233,0.00003640402,0.0000750422,0.00001706486,0.00002017075,0.0009250724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004592135,"threshold_uncertainty_score":0.01533598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01495214523306821,"score_gpt":0.2493510113538211,"score_spread":0.2343988661207529,"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."}}