{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001138627,0.000122525,0.0001712001,0.00004701158,0.0006990238,0.0006412219,0.008617163,0.00005699439,0.000004608526],"category_scores_gemma":[0.0001181338,0.0001059366,0.00001210917,0.0001268786,0.00008638827,0.002249295,0.004660972,0.0001989393,0.000006790468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002059114,"about_ca_system_score_gemma":0.00008293003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001443347,"about_ca_topic_score_gemma":0.0001635576,"domain_scores_codex":[0.9985441,0.00007717551,0.0002290494,0.000595057,0.0002193919,0.0003352373],"domain_scores_gemma":[0.9925817,0.0001618997,0.0001902801,0.006898442,0.00008738841,0.00008024549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005635807,0.0002816964,0.001990017,0.00007467445,0.00008361285,0.00001712987,0.0007247021,0.09289831,0.0001007857,0.01448493,0.004993455,0.8842943],"study_design_scores_gemma":[0.0007393942,0.00002660326,0.0005820217,0.0001588486,0.000003958141,0.000004244301,0.00001794895,0.9866493,0.00003099352,0.001150281,0.01048397,0.0001524115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001869957,0.0002110906,0.9958382,0.002631285,0.0001277558,0.0004333449,0.00003598646,0.00008469363,0.0004506844],"genre_scores_gemma":[0.0331138,0.0001265187,0.9660069,0.0001171616,0.0000953451,0.00002757047,0.0004130551,0.00001742698,0.00008223399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.893751,"threshold_uncertainty_score":0.9967467,"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."}}