Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem
暂无分享,去创建一个
[1] David Thomas,et al. The Art in Computer Programming , 2001 .
[2] Peter J. Stuckey,et al. Dynamic Programming to Minimize the Maximum Number of Open Stacks , 2007, INFORMS J. Comput..
[3] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..
[4] Matthew W. Moskewicz,et al. Cha : Engineering an e cient SAT solver , 2001, DAC 2001.
[5] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[6] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[7] Ulrich Junker. Conflict Detection for Arbitrary Constraint Propagation Algorithms , 2001 .
[8] José Carlos Becceneri,et al. A method for solving the minimization of the maximum number of open stacks problem within a cutting process , 2004, Comput. Oper. Res..
[9] Patrick Prosser,et al. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .
[10] N. J.L.deSiqueira,et al. Explanation-Based Generalisation of Failures , 1988, ECAI.
[11] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[12] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[13] Fahiem Bacchus,et al. Generalized NoGoods in CSPs , 2005, AAAI.
[14] Thomas Schiex,et al. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.
[15] Thomas Schiex,et al. Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).
[16] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .