{"id":"W278336051","doi":"10.1007/s10489-015-0670-1","title":"A formal proof of the 𝜖-optimality of discretized pursuit algorithms","year":2015,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Computer science; Algorithm; Discretization; Formal proof; Monotonic function; Action (physics); Proof of concept; 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":[],"consensus_categories":[],"category_scores_codex":[0.0008576582,0.00009665697,0.0001722459,0.00004396086,0.00004674587,0.00003457285,0.001578139,0.00004622928,0.00002091487],"category_scores_gemma":[0.00007856031,0.00006432266,0.00006249759,0.0005710209,0.0002136446,0.0002376297,0.0006166406,0.0001196764,0.000009849186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002142195,"about_ca_system_score_gemma":0.0001609897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003042605,"about_ca_topic_score_gemma":0.000003224265,"domain_scores_codex":[0.9985847,0.00004943505,0.0003712272,0.0002131038,0.0005499292,0.0002315411],"domain_scores_gemma":[0.9988071,0.00005639847,0.000187363,0.0006258754,0.0002297934,0.00009342163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004571744,0.0002273168,0.00020753,0.00006034085,0.00002679049,5.746399e-7,0.004372397,0.0254697,0.001585616,0.83356,0.0004337069,0.1340102],"study_design_scores_gemma":[0.000372294,0.000202057,0.0002505563,0.00004013736,0.000008538498,0.000005612601,0.0004177752,0.4905166,0.4533243,0.05316366,0.001458399,0.0002400698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001080461,0.0000352923,0.9824101,0.0003679922,0.0001070419,0.0004283966,0.000003259262,0.00003072395,0.01553677],"genre_scores_gemma":[0.892129,0.000006803963,0.107539,0.00008722072,0.0000119802,0.00003312444,0.000001183228,0.000005203136,0.0001864908],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8910486,"threshold_uncertainty_score":0.2932601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05193330201294354,"score_gpt":0.2882998452492054,"score_spread":0.2363665432362618,"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."}}