{"id":"W2754604279","doi":"10.1007/s00453-017-0373-6","title":"Algorithms for Communication Scheduling in Data Gathering Network with Data Compression","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Job shop scheduling; Polynomial-time approximation scheme; Approximation algorithm; Computer science; Data compression; Scheduling (production processes); Mathematical optimization; Time complexity; Dynamic programming; Theory of computation; Wireless sensor network; Base station; Optimization problem; Data transmission; Algorithm; Mathematics; Computer network","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.00225641,0.001217247,0.001648868,0.001540888,0.001502066,0.001959741,0.002385223,0.001686062,0.00421753],"category_scores_gemma":[0.008411657,0.0007037025,0.0009261139,0.002823146,0.001157469,0.002769157,0.001771465,0.001875954,0.0004309026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002580294,"about_ca_system_score_gemma":0.003700142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006644467,"about_ca_topic_score_gemma":0.005430401,"domain_scores_codex":[0.9991438,0.0002836986,0.00004780494,0.0001592129,0.0001975642,0.0001678424],"domain_scores_gemma":[0.9948631,0.00389395,0.0003267298,0.000350445,0.0003744143,0.0001913625],"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.0001842728,0.0001187612,0.0005472411,0.0001580365,0.00003201106,0.00003296348,0.0001238424,0.8786215,0.0007841712,0.04032959,0.004615804,0.07445181],"study_design_scores_gemma":[0.00002077271,0.00001614414,0.00005770919,0.00000678289,0.000007074626,0.00000994572,0.0000185942,0.9830043,0.0002442125,0.01619889,0.0004120374,0.00000357053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01863513,0.0005705646,0.9760485,0.0005633513,0.0001105517,0.0001492967,0.0001152064,0.0003946444,0.003412727],"genre_scores_gemma":[0.3531828,0.0008220695,0.6391032,0.0002134767,0.000259521,0.0006614588,0.000365961,0.0002593484,0.005132297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006644467,"threshold_uncertainty_score":0.01872146,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1896481992940429,"score_gpt":0.3807958753073195,"score_spread":0.1911476760132766,"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."}}