{"id":"W2582616273","doi":"10.1007/978-3-319-53058-1_7","title":"A 2-Approximation Algorithm for Barrier Coverage by Weighted Non-uniform Sensors on a Line","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Generalization; Computer science; Line (geometry); Algorithm; Approximation algorithm; Simple (philosophy); Perimeter; Line segment; Mathematics; Artificial intelligence","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009524481,0.0008564201,0.0007993006,0.0007960561,0.0007854621,0.001103215,0.004173139,0.0006628326,0.00001121661],"category_scores_gemma":[0.0000996993,0.0007773996,0.0002589698,0.0003086993,0.0006305213,0.0006987802,0.0008556589,0.000963087,0.00003482704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004511873,"about_ca_system_score_gemma":0.0003884789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000017872,"about_ca_topic_score_gemma":0.00002303746,"domain_scores_codex":[0.994723,0.0000349626,0.0006821707,0.002193972,0.001319009,0.001046871],"domain_scores_gemma":[0.9952877,0.000755608,0.0007194751,0.002504489,0.000436777,0.0002959444],"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.0000113119,0.00005101862,9.6732e-7,0.00002520854,0.00001685076,0.0000379753,0.0002448515,0.2454296,0.00009002297,0.003789608,0.0001692174,0.7501333],"study_design_scores_gemma":[0.0006990741,0.000467556,0.000002347119,0.0004738048,0.00001093631,0.00002948802,7.100559e-8,0.9688962,0.00471901,0.01826965,0.005577227,0.0008546695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007169575,0.0001129154,0.9920845,0.0005067398,0.002497292,0.0009954055,0.00006527586,0.0002161391,0.003450028],"genre_scores_gemma":[0.02089657,0.00009355442,0.9720722,0.001729326,0.001180778,0.00006094228,0.0001018394,0.0001162714,0.003748459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7492787,"threshold_uncertainty_score":0.9999337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01185709224394747,"score_gpt":0.2392769737842001,"score_spread":0.2274198815402526,"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."}}