{"id":"W2150648752","doi":"10.1109/iscit.2007.4392156","title":"Dynamic sensor activation for maximizing network lifetime under coverage constraint","year":2007,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Wireless sensor network; Heuristic; Computer science; Integer programming; Quality of service; Greedy algorithm; Constraint (computer-aided design); Linear programming; Polynomial; Mathematical optimization; Distributed computing; Real-time computing; Computer network; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0006810288,0.000198027,0.000192341,0.00009590873,0.0002247821,0.0001517058,0.0004345485,0.0001417276,0.00002059786],"category_scores_gemma":[0.00003222571,0.0001899893,0.0001031273,0.0004249263,0.00005978368,0.0002684566,0.0001096147,0.0001538823,0.00001963275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001431757,"about_ca_system_score_gemma":0.00004662127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001324622,"about_ca_topic_score_gemma":0.00002753489,"domain_scores_codex":[0.9981866,0.00003920648,0.0003441426,0.0004775621,0.0002654039,0.0006870624],"domain_scores_gemma":[0.9983722,0.0007727234,0.000142478,0.000466675,0.0001153518,0.0001305686],"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.00002135634,0.00004126049,0.00005538992,0.000006296295,0.00002384704,0.000005272434,0.00005030722,0.7838947,0.001535366,0.1959326,0.0005379876,0.01789553],"study_design_scores_gemma":[0.000588559,0.00006411681,0.001180444,0.0000383222,0.000006093545,0.00001878096,0.00003840037,0.9894946,0.002143682,0.002340128,0.003760723,0.0003261195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0207518,0.00002458175,0.9706427,0.001253397,0.0005188871,0.0003093482,8.089546e-7,0.0004118363,0.006086675],"genre_scores_gemma":[0.7108145,0.000005760192,0.2865725,0.00172361,0.0001162429,0.000006574028,0.00001006273,0.00001917592,0.0007315749],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6900627,"threshold_uncertainty_score":0.7747539,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01168012671984546,"score_gpt":0.2437751442763548,"score_spread":0.2320950175565094,"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."}}