{"id":"W1963869843","doi":"10.1109/dcoss.2011.5982193","title":"Sleep scheduling towards geographic routing in duty-cycled sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Geographic routing; Computer science; Wireless sensor network; Scheduling (production processes); Greedy algorithm; Computer network; Routing (electronic design automation); Routing algorithm; Geographic information system; Static routing; Real-time computing; Routing protocol; Distributed computing; Algorithm; Geography; Mathematical optimization; Mathematics; Remote sensing","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.0007262036,0.0003029484,0.0003332643,0.0003602147,0.0001592895,0.0001460989,0.001200265,0.0002220809,0.00005779253],"category_scores_gemma":[0.00005053184,0.0002853761,0.0001458144,0.001456396,0.00007748465,0.0004227602,0.0004950615,0.0004904325,0.0000334933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005168974,"about_ca_system_score_gemma":0.00002653808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006405264,"about_ca_topic_score_gemma":0.000176106,"domain_scores_codex":[0.9972097,0.0001706359,0.0005437667,0.0007743269,0.0003521599,0.000949403],"domain_scores_gemma":[0.9985774,0.0001188673,0.0001514212,0.0008699077,0.00009430193,0.0001880918],"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.00001416695,0.0001611645,0.04000106,0.000005867527,0.00002852681,0.0001304458,0.0007817601,0.8701288,0.00008330498,0.06266451,0.000009737134,0.02599071],"study_design_scores_gemma":[0.0004123765,0.00003794118,0.01979753,0.00004345952,0.000005297677,0.00001793844,0.00007553627,0.9785592,0.0004662901,0.0001866889,0.00002988444,0.0003678547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2909348,0.0001167018,0.6930163,0.0001087613,0.0006442372,0.0001327704,1.286654e-7,0.0005066643,0.01453966],"genre_scores_gemma":[0.818425,0.00002653901,0.1809558,0.0003456927,0.0001200869,0.00001106282,0.000001483817,0.00002484357,0.00008954018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5274902,"threshold_uncertainty_score":0.9999598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01996165552834978,"score_gpt":0.2150519989273128,"score_spread":0.195090343398963,"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."}}