{"id":"W7124137218","doi":"10.65109/zbuc3779","title":"Optimal solutions for moving target search","year":2009,"lang":"","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Minimax; Polynomial; Work (physics); Time complexity; Adaptation (eye)","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":[],"consensus_categories":[],"category_scores_codex":[0.00148619,0.0002344561,0.0002447065,0.0002525037,0.001216825,0.0009085329,0.001085619,0.0001407019,0.0008746465],"category_scores_gemma":[0.0001169981,0.0002347261,0.0001981329,0.0008025541,0.0001012473,0.00109268,0.0003728191,0.0002840789,0.0001947206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009467019,"about_ca_system_score_gemma":0.0005496562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001658583,"about_ca_topic_score_gemma":0.000001761975,"domain_scores_codex":[0.9966859,0.0001353139,0.0004637755,0.0007034396,0.0005260016,0.001485604],"domain_scores_gemma":[0.9981741,0.0001489105,0.00006125965,0.0006115498,0.0005750118,0.0004292128],"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.00001726207,0.0003247015,0.00001210594,0.00002276382,0.00002046043,0.000003202823,0.001265226,0.5570953,0.0003706324,0.3756849,0.01141079,0.05377268],"study_design_scores_gemma":[0.0006679642,0.0006589615,0.0001284632,0.00002329186,0.000005338398,0.000006853593,0.00009718716,0.9867653,0.0004662565,0.002652327,0.008229298,0.0002987895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001046976,0.0002718778,0.9588522,0.02112425,0.0003506781,0.000949625,0.00001360941,0.0001968693,0.01813619],"genre_scores_gemma":[0.1604248,0.0001052002,0.820604,0.001748266,0.0001869674,0.00002393441,0.00001234323,0.0000134069,0.01688111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.42967,"threshold_uncertainty_score":0.9576766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06204276209070982,"score_gpt":0.3152180448769508,"score_spread":0.253175282786241,"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."}}