{"id":"W2109117475","doi":"10.1109/ictai.2007.38","title":"On Portfolios for Backtracking Search in the Presence of Deadlines","year":2007,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backtracking; Computer science; Look-ahead; Constraint learning; Testbed; Mathematical optimization; Scheduling (production processes); Schedule; Portfolio; Limit (mathematics); Beam stack search; Constraint satisfaction; Constraint satisfaction problem; Satisfiability; Theoretical computer science; Search algorithm; Algorithm; Mathematics; Artificial intelligence; Local consistency","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.0007092837,0.0000322977,0.00003988985,0.00008667934,0.00002753821,0.00002346771,0.0002235202,0.00001797597,0.00001992206],"category_scores_gemma":[0.00007142324,0.0000216049,0.00001972581,0.0002473453,0.00001785367,0.0001173838,0.00001724992,0.00004067494,0.000002060464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006659746,"about_ca_system_score_gemma":0.00002224437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002396846,"about_ca_topic_score_gemma":0.0001179915,"domain_scores_codex":[0.9995204,0.00001720124,0.0001276206,0.00009546462,0.0001386761,0.0001006729],"domain_scores_gemma":[0.9992925,0.0004667018,0.00002473988,0.0001464117,0.00005622226,0.00001342449],"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.00001775138,0.00006366693,0.00917282,0.00001311133,0.000002855708,0.000003455923,0.001242449,0.007681872,0.0004179933,0.7544134,0.0004077564,0.2265628],"study_design_scores_gemma":[0.0009755454,0.0002459936,0.2867339,0.00005918895,0.000002945355,0.00002440163,0.0009816017,0.6785851,0.02057533,0.01071425,0.0008757017,0.0002260535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03974402,0.000003977361,0.9539454,0.0006204491,0.00005970191,0.0001772376,3.17044e-7,0.00001554407,0.005433376],"genre_scores_gemma":[0.9597102,0.000002375293,0.03993713,0.0002499304,0.00001174904,0.000002751091,4.777078e-7,0.000001259506,0.00008413869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9199662,"threshold_uncertainty_score":0.08810223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03205481278515062,"score_gpt":0.3142591896383012,"score_spread":0.2822043768531506,"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."}}