{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194791,0.001075494,0.001097246,0.0006437654,0.0004857226,0.001323544,0.002014697,0.0008220299,0.005506631],"category_scores_gemma":[0.005141123,0.0005867312,0.001190647,0.0008362178,0.001417783,0.002570078,0.001909231,0.001926417,0.0009433815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008871847,"about_ca_system_score_gemma":0.001930729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002205555,"about_ca_topic_score_gemma":0.003586139,"domain_scores_codex":[0.997866,0.0008492227,0.0001178123,0.0004520072,0.0005067498,0.0002082839],"domain_scores_gemma":[0.9970155,0.001428218,0.0002909184,0.0009521474,0.0002401484,0.00007298495],"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.000733475,0.0003987832,0.0009771317,0.0001998887,0.0000690091,0.0001465402,0.0002400995,0.6712428,0.02182862,0.07447914,0.003664976,0.2260196],"study_design_scores_gemma":[0.0001039926,0.0002147361,0.00019778,0.0000174127,0.0000235603,0.00003642134,0.00002747246,0.9597834,0.01030923,0.02611972,0.003140297,0.00002598576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02452561,0.0001858322,0.9681722,0.0001913173,0.00002964987,0.0001123515,0.00007941486,0.002779712,0.003923934],"genre_scores_gemma":[0.3516308,0.0001460088,0.6436548,0.00023657,0.00003376898,0.0003256753,0.0004247421,0.0006380681,0.002909401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005506631,"threshold_uncertainty_score":0.01842153,"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."}}