{"id":"W243337683","doi":"10.7939/r3xw47z9h","title":"Better Time Constrained Search via Randomization and Postprocessing","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Satisficing; Bounding overwatch; Set (abstract data type); Beam search; Mathematical optimization; Metric (unit); Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Quality (philosophy); Hypersphere; Performance metric; Search algorithm; Algorithm; Artificial intelligence; 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.000247672,0.00006961455,0.00008961696,0.00005502023,0.0001273818,0.0003031648,0.0001496064,0.00003665286,0.0001883202],"category_scores_gemma":[0.00001127882,0.00005530946,0.00001334946,0.0001217533,0.00003499775,0.0004869341,0.00006246473,0.00007104412,0.0001999117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005661733,"about_ca_system_score_gemma":0.0000278218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005048155,"about_ca_topic_score_gemma":2.912244e-7,"domain_scores_codex":[0.9993999,0.0000327215,0.0001099521,0.0001806434,0.0001091414,0.0001676497],"domain_scores_gemma":[0.999616,0.0001084658,0.0000245532,0.0001176028,0.00006891842,0.00006447058],"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.00005749743,0.0000611643,0.01820893,0.0001296813,0.00006496685,0.00002025419,0.00463603,0.0009862804,0.04921431,0.005141419,0.01121278,0.9102667],"study_design_scores_gemma":[0.00123692,0.00003646333,0.001101699,0.00003015801,0.000002805937,0.00002639379,0.000009632937,0.9930373,0.002373447,0.001886054,0.0001168857,0.0001422759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06679823,0.00005450817,0.9235489,0.003311562,0.00003271256,0.0001372452,2.309222e-7,0.0001567809,0.005959804],"genre_scores_gemma":[0.8832612,0.000001003584,0.1148611,0.001076646,0.00002608042,0.000005002692,0.00000398867,0.000004504046,0.0007604582],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.992051,"threshold_uncertainty_score":0.2923425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005677347678714625,"score_gpt":0.1995495284829584,"score_spread":0.1938721808042437,"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."}}