{"id":"W2468468006","doi":"10.1109/twc.2016.2585490","title":"A Column Generation Method for Constructing and Scheduling Multiple Forwarding Trees in Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Column generation; Scheduling (production processes); Wireless sensor network; Schedule; Job shop scheduling; Distributed computing; Computer network; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343778,0.00132851,0.0009939134,0.0008991392,0.0007680301,0.0007768195,0.001206718,0.0008527844,0.003171488],"category_scores_gemma":[0.002599338,0.0006147695,0.0009498345,0.001464906,0.0006353093,0.001396919,0.001028186,0.001718071,0.0008282895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008516127,"about_ca_system_score_gemma":0.001915993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0037481,"about_ca_topic_score_gemma":0.005662294,"domain_scores_codex":[0.9992645,0.0002897186,0.00003281632,0.0001175021,0.0001833405,0.0001122087],"domain_scores_gemma":[0.9984326,0.0009769012,0.0001390095,0.0001509049,0.0002160822,0.00008453302],"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.0001255796,0.0001644413,0.0005055353,0.0002032608,0.00005449002,0.000107163,0.0001114204,0.7912958,0.006260008,0.02185993,0.007457457,0.1718549],"study_design_scores_gemma":[0.00001898459,0.00005943391,0.00005338017,0.00001098299,0.0000095529,0.00003429787,0.00001846191,0.9887632,0.001148866,0.008261559,0.001611573,0.000009621181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003653221,0.0001543247,0.9947253,0.00009425793,0.00004429863,0.00007811886,0.00009348115,0.0002993303,0.0008577941],"genre_scores_gemma":[0.08961666,0.0002941627,0.9074491,0.0001477524,0.0000778317,0.0002638485,0.0005102033,0.0001581845,0.001482427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0037481,"threshold_uncertainty_score":0.01060963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03691488863853425,"score_gpt":0.2842111178186132,"score_spread":0.247296229180079,"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."}}