{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001036531,0.0006131001,0.0006395009,0.0005269123,0.0003044452,0.0002219401,0.003172924,0.0002900453,0.00001006114],"category_scores_gemma":[0.0001039146,0.0004493761,0.0002707911,0.0004792168,0.0004678154,0.0001723867,0.0007386012,0.0006384033,0.000005956099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003120506,"about_ca_system_score_gemma":0.0002807906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008126341,"about_ca_topic_score_gemma":0.00002269393,"domain_scores_codex":[0.995643,0.00005201824,0.0007480034,0.001460276,0.001310337,0.0007863917],"domain_scores_gemma":[0.9956964,0.001487139,0.0005234988,0.001851387,0.0002932231,0.0001483445],"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.00001701845,0.00004225715,0.00000150294,0.00001875418,0.00001227115,0.00001637613,0.0002547667,0.6291218,0.0001930615,0.0165649,0.00003049341,0.3537268],"study_design_scores_gemma":[0.0005552439,0.0007522086,0.00001437624,0.0005797219,0.00001421123,0.00001215533,2.989764e-7,0.8933935,0.007572324,0.09465155,0.00187969,0.0005747131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002290085,0.0003391727,0.9937012,0.001400178,0.001529133,0.0008692537,0.00001444266,0.00008628668,0.001831352],"genre_scores_gemma":[0.1681125,0.0002365715,0.8095902,0.01892541,0.001235126,0.00005553024,0.00001722272,0.0001129468,0.001714524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3531521,"threshold_uncertainty_score":0.9997958,"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."}}