{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01308936,0.001590251,0.002860178,0.002318048,0.001078994,0.002504738,0.003123346,0.002456358,0.003833434],"category_scores_gemma":[0.05646348,0.001253493,0.0008732741,0.002448916,0.001927854,0.006024113,0.003173555,0.002847684,0.0009792215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001762889,"about_ca_system_score_gemma":0.002303659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002684197,"about_ca_topic_score_gemma":0.00336792,"domain_scores_codex":[0.9942578,0.003197576,0.0004041698,0.0008262364,0.0009186724,0.0003954836],"domain_scores_gemma":[0.9631238,0.02929734,0.001703503,0.003327387,0.001786769,0.0007612082],"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.0005887487,0.0004629249,0.004293032,0.0001840054,0.0001082213,0.000114009,0.0002296438,0.7299767,0.0009597919,0.03642836,0.002820329,0.2238342],"study_design_scores_gemma":[0.00006671392,0.0001209844,0.0001708684,0.00002658699,0.00001754955,0.00002659965,0.00003056863,0.96903,0.0003387289,0.02939642,0.0007666958,0.000008224374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06421734,0.001380499,0.9264057,0.0009651589,0.0000864586,0.0004174946,0.0001508821,0.001371681,0.00500482],"genre_scores_gemma":[0.4677592,0.0008498339,0.5257113,0.0005763369,0.0001848694,0.0008024388,0.0006211917,0.0003853655,0.003109542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01308936,"threshold_uncertainty_score":0.069224,"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."}}