{"id":"W2244307845","doi":"10.1109/ictai.2015.135","title":"RLBS: An Adaptive Backtracking Strategy Based on Reinforcement Learning for Combinatorial Optimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Backtracking; Reinforcement learning; Computer science; Mathematical optimization; Iterative deepening depth-first search; Search tree; Combinatorial search; Search algorithm; Scheduling (production processes); Beam stack search; Beam search; Binary number; Combinatorial optimization; Artificial intelligence; Algorithm; Mathematics; Best-first search","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.001410606,0.001086877,0.001313769,0.0009213432,0.0003832425,0.000783777,0.0021451,0.001133425,0.003242127],"category_scores_gemma":[0.004154417,0.0005110891,0.0007640378,0.0008765904,0.001075634,0.001032368,0.001196684,0.001715396,0.0006464562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009823664,"about_ca_system_score_gemma":0.001678234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006897571,"about_ca_topic_score_gemma":0.006867048,"domain_scores_codex":[0.9992428,0.0002911204,0.00004435656,0.00009720857,0.0002386315,0.00008598021],"domain_scores_gemma":[0.9980243,0.001294455,0.0001858742,0.0001366163,0.0002493095,0.0001095093],"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.0001393163,0.0001999066,0.001175371,0.00013378,0.00007294403,0.00009395793,0.00009698532,0.820329,0.003556173,0.01065765,0.002548877,0.1609961],"study_design_scores_gemma":[0.00002618948,0.00004038767,0.00005253157,0.000008388153,0.000007068453,0.0000117024,0.000004382863,0.9964341,0.0004512024,0.002471963,0.0004875184,0.000004573055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01527892,0.0003330377,0.9799532,0.0001672367,0.00005197968,0.0001235716,0.00004065014,0.001600814,0.002450538],"genre_scores_gemma":[0.4309322,0.0004054152,0.5640485,0.0003407946,0.0000597185,0.0004516318,0.0001985972,0.0003243421,0.003238628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006897571,"threshold_uncertainty_score":0.01371485,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05122607948455666,"score_gpt":0.2803174550396211,"score_spread":0.2290913755550644,"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."}}