{"id":"W2099104905","doi":"10.1109/wimob.2007.4390857","title":"Energy-Efficient State Scheduling for Maximizing Sensor Network Lifetime under Coverage Constraint","year":2007,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Wireless sensor network; Computer science; Scheduling (production processes); Integer programming; Energy consumption; Linear programming; Distributed computing; Mathematical optimization; Real-time computing; Computer network; Engineering; Algorithm; Mathematics","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.00144099,0.0003871263,0.0003814642,0.0001783919,0.000425389,0.0003165836,0.0008137009,0.0001667608,0.00002460707],"category_scores_gemma":[0.00003796219,0.0003675334,0.000216663,0.000730182,0.0001334801,0.000165233,0.0003299984,0.0002385097,0.00002369927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001642059,"about_ca_system_score_gemma":0.0001094525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003613345,"about_ca_topic_score_gemma":0.00004200702,"domain_scores_codex":[0.996325,0.0000833997,0.0006943237,0.0008896909,0.0005246414,0.001482966],"domain_scores_gemma":[0.9973301,0.001058433,0.0002424341,0.000781492,0.0002316461,0.0003558616],"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.00002430562,0.00006803468,0.00002851763,0.000006292261,0.00003340499,0.00002638819,0.00006695586,0.7699066,0.0004366674,0.2133817,0.0002136089,0.01580748],"study_design_scores_gemma":[0.0007737738,0.00007898125,0.00009403766,0.0000570443,0.00001055251,0.00003952796,0.00005885673,0.9875225,0.003877816,0.001660783,0.005300898,0.0005251612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02564561,0.0002211184,0.9653414,0.0006030991,0.001273946,0.0002728394,0.000003612753,0.0006388159,0.005999552],"genre_scores_gemma":[0.6507336,0.00001948207,0.346324,0.001737368,0.0003344073,0.0000109392,0.00000776631,0.00003858927,0.0007939118],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.625088,"threshold_uncertainty_score":0.9998777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01368049380491713,"score_gpt":0.2348445468373851,"score_spread":0.221164053032468,"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."}}