Towards Inferring Labelling Heuristics for CSP Application Domains
暂无分享,去创建一个
[1] Pierre Flener,et al. Compiling High-Level Type Constructors in Constraint Programming , 2001, PADL.
[2] Jan Friso Groote,et al. Syntax and semantics of CRL , 1995 .
[3] Philippe Codognet,et al. Compiling Constraints in clp(FD) , 1996, J. Log. Program..
[4] Jonathan Gratch,et al. Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study , 1996, J. Artif. Intell. Res..
[5] Pierre Flener,et al. A Meta-heuristic for Subset Problems , 2001, PADL.
[6] John N. Hooker,et al. Testing heuristics: We have it all wrong , 1995, J. Heuristics.
[7] T. Ellman,et al. A transformation system for interactive reformulation of design optimization strategies , 1998 .
[8] Norman M. Sadeh,et al. Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..
[9] Yannis C. Stamatiou,et al. Random Constraint Satisfaction: A More Accurate Picture , 1997, CP.
[10] Pascal Van Hentenryck. The OPL optimization programming language , 1999 .
[11] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.