{"id":"W2119940423","doi":"10.1109/tsp.2007.897908","title":"Structured Threshold Policies for Dynamic Sensor Scheduling—A Partially Observed Markov Decision Process Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Markov decision process; Mathematical optimization; Markov chain; Markov process; Scheduling (production processes); Computer science; Dynamic priority scheduling; Markov model; Job shop scheduling; Mathematics; Machine learning; Schedule; Statistics","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.0005880698,0.0003662782,0.0003342435,0.000301033,0.0009038408,0.0005703403,0.0006222765,0.0002443336,0.00001138977],"category_scores_gemma":[0.000009967682,0.0003356685,0.0002123591,0.001146351,0.00009496081,0.0007218517,0.000004571268,0.0004438023,0.000005530431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206431,"about_ca_system_score_gemma":0.000156676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005489692,"about_ca_topic_score_gemma":0.00003284381,"domain_scores_codex":[0.9972628,0.00003133619,0.0006034886,0.0007675042,0.00060752,0.0007273958],"domain_scores_gemma":[0.9985349,0.0002040291,0.0002188073,0.0003756201,0.0004202882,0.000246422],"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.0003595882,0.0002384718,0.000007521709,0.0001035411,0.00004068906,0.000007211885,0.0004399787,0.436706,0.003334088,0.00006994986,0.00001361518,0.5586793],"study_design_scores_gemma":[0.0009371077,0.0001857333,0.0001255768,0.00009852387,0.00003631524,0.00005562384,0.0002742813,0.9694114,0.02683198,0.001481001,0.000128389,0.0004341101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03094151,0.0001133852,0.9671553,0.0001110314,0.0004885636,0.0005170794,0.00002753094,0.0004890626,0.0001565512],"genre_scores_gemma":[0.816572,0.000005721356,0.182927,0.0002109278,0.0001083795,0.00004413422,0.00000699136,0.00003580756,0.00008899931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7856305,"threshold_uncertainty_score":0.9999095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02873138239138811,"score_gpt":0.2848172879348059,"score_spread":0.2560859055434178,"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."}}