{"id":"W1530465016","doi":"10.1007/978-3-642-04383-3_15","title":"On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Traverse; Wireless sensor network; Line (geometry); Range (aeronautics); Computer science; Line segment; Algorithm; Plane (geometry); Approximation algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Geometry; Artificial intelligence; Computer network; Engineering","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.0009003339,0.002184319,0.001599423,0.0009051579,0.0005233024,0.0008417182,0.001773239,0.001207969,0.004022115],"category_scores_gemma":[0.003964815,0.0005703913,0.0008173792,0.001298569,0.0008174665,0.001555227,0.001479822,0.001027413,0.0005471705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00100958,"about_ca_system_score_gemma":0.000695885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003397116,"about_ca_topic_score_gemma":0.00273744,"domain_scores_codex":[0.9994753,0.0001932386,0.00001910353,0.00008968837,0.0001368717,0.00008581539],"domain_scores_gemma":[0.9986565,0.0009989425,0.00009858495,0.00008078985,0.0001049718,0.00006018881],"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.0002727783,0.00006198692,0.0005179425,0.0002509422,0.00004788744,0.00005429868,0.0001350702,0.9068102,0.009446073,0.01845417,0.003648483,0.06030022],"study_design_scores_gemma":[0.00001313611,0.0001101743,0.0002996362,0.00001933437,0.00001372284,0.0000482248,0.00003703887,0.989625,0.001404383,0.007559029,0.0008616721,0.00000861608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04146918,0.000873957,0.9497972,0.0002895567,0.00006085969,0.000111533,0.0001649575,0.0002827539,0.00695002],"genre_scores_gemma":[0.6397978,0.00181798,0.3431223,0.0001967264,0.0001352069,0.0004343601,0.0005226577,0.0008704954,0.0131024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004022115,"threshold_uncertainty_score":0.01345533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01352435446527159,"score_gpt":0.2316597490083877,"score_spread":0.2181353945431161,"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."}}