{"id":"W2110722897","doi":"10.1109/icassp.2006.1660926","title":"Transmission Scheduling for Sensor Network Lifetime Maximization: A Shortest Path Bandit Formulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Scheduling (production processes); Maximization; Mathematical optimization; Shortest path problem; Computer science; Independent and identically distributed random variables; Job shop scheduling; Dynamic priority scheduling; Fading; Fair-share scheduling; Channel (broadcasting); Computer network; Mathematics; Random variable; Theoretical computer science; Quality of service; Routing (electronic design automation)","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001758161,0.0001838996,0.0002839629,0.0002022338,0.0004782579,0.000305785,0.0003738646,0.0001348589,0.0009649328],"category_scores_gemma":[0.0006322856,0.0001321176,0.0001573606,0.001032725,0.00004489529,0.000621353,0.0000488667,0.0001299754,0.0001271152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006129008,"about_ca_system_score_gemma":0.00008382042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001683485,"about_ca_topic_score_gemma":0.00001608344,"domain_scores_codex":[0.9966094,0.00008773804,0.0007577508,0.0005912057,0.001413804,0.0005400642],"domain_scores_gemma":[0.9971123,0.001548528,0.0001569398,0.0004061041,0.0006307053,0.0001454625],"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.0001148351,0.00005812768,0.002742485,0.000004302233,0.00000642125,0.000004603452,0.00003106504,0.9360881,0.0003118982,0.001661711,0.006371931,0.05260454],"study_design_scores_gemma":[0.0007203967,0.00009278354,0.003120948,0.00001849989,0.000007494395,0.000006788613,0.00005351039,0.8778985,0.0007524803,0.07597727,0.04115334,0.000197986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003448507,0.0001400495,0.9928058,0.0009411965,0.0001752566,0.0007298958,0.00001468093,0.0001183676,0.001626232],"genre_scores_gemma":[0.5972196,0.00001352627,0.3906275,0.000113667,0.001273474,0.00006439259,0.0001052909,0.00003831059,0.0105442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6021783,"threshold_uncertainty_score":0.9999483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06525706696555161,"score_gpt":0.3795517146559486,"score_spread":0.3142946476903969,"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."}}