{"id":"W2809074861","doi":"10.1109/tcomm.2018.2848271","title":"Optimum ConvergeCast Scheduling in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Schedule; Real-time computing; Upper and lower bounds; Computer network; Distributed computing; Mathematical optimization; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003365807,0.0002369951,0.0002401683,0.0003418339,0.0006994166,0.0001466747,0.002490283,0.0001777612,0.00003453195],"category_scores_gemma":[0.000005722889,0.0002636982,0.0001128978,0.001483405,0.000397285,0.0003644973,0.0000318583,0.0007403172,0.000159281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378748,"about_ca_system_score_gemma":0.00007143996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008641851,"about_ca_topic_score_gemma":0.0005602864,"domain_scores_codex":[0.9980311,0.0003114725,0.000459766,0.0004652184,0.0002447615,0.0004876821],"domain_scores_gemma":[0.9957456,0.0005117717,0.000117866,0.003285553,0.0001975613,0.0001416663],"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.00001386306,0.0004669151,0.00004598201,0.000003065579,0.00002866372,0.000004075415,0.0004460902,0.9735986,0.0004506345,0.008426189,0.00005721212,0.0164587],"study_design_scores_gemma":[0.0004093648,0.00007584009,0.0001191272,0.00007958147,0.000009182397,0.00001525062,0.00006573626,0.9958686,0.002326121,0.00004863597,0.0007104008,0.0002721683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01746152,0.00008296627,0.9765063,0.001707874,0.0009325682,0.0002111974,0.000004045565,0.0003776691,0.002715884],"genre_scores_gemma":[0.9028335,0.0003466388,0.09603433,0.0003489024,0.00006814893,0.00006721207,0.000003958407,0.00002882828,0.0002685386],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8853719,"threshold_uncertainty_score":0.9999815,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02767919547796047,"score_gpt":0.26718935985904,"score_spread":0.2395101643810795,"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."}}