{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000970195,0.0008190259,0.0008277936,0.0003913872,0.0003735012,0.0007820454,0.001130536,0.0007051175,0.001759866],"category_scores_gemma":[0.003329326,0.0003442293,0.0003166527,0.0007490527,0.0005184097,0.001138689,0.0007414144,0.000574402,0.0002174818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000670897,"about_ca_system_score_gemma":0.000753089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007331948,"about_ca_topic_score_gemma":0.0009505991,"domain_scores_codex":[0.9992022,0.0002896331,0.00003022693,0.0001856444,0.0001351469,0.0001570717],"domain_scores_gemma":[0.998548,0.0009843243,0.0001939756,0.0000915793,0.0001018753,0.00008021736],"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.0003355277,0.0001356164,0.0009419417,0.0002161965,0.00005225895,0.000204548,0.0001964933,0.8743687,0.02188422,0.02562572,0.002324773,0.07371414],"study_design_scores_gemma":[0.00002944276,0.00009823056,0.000195273,0.00001024004,0.00001849751,0.0001059443,0.00004276101,0.9868928,0.005029515,0.006242878,0.001325526,0.000008884896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08283803,0.0006171168,0.908506,0.0003857554,0.00003589688,0.0001621846,0.0001000171,0.0005008397,0.006854179],"genre_scores_gemma":[0.8926659,0.0003297291,0.1046326,0.0001025283,0.00003774878,0.0002410101,0.00008046033,0.00008891295,0.001821221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001759866,"threshold_uncertainty_score":0.00588733,"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."}}