Partial Constraint Satisfaction
暂无分享,去创建一个
[1] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[2] Martin Charles Golumbic,et al. Optimization Algorithms for Student Scheduling via Constraint Satisfiability , 1990, Computer/law journal.
[3] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.
[4] Eugene C. Freuder. Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.
[5] Rina Dechter,et al. Tree Decomposition with Applications to Constraint Processing , 1990, AAAI.
[6] Eugene C. Freuder,et al. Improved relaxation and search methods for approximate constraint satisfaction with a maximin criter , 1990 .
[7] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[8] Bernard A. Nadel,et al. Constraint satisfaction algorithms 1 , 1989, Comput. Intell..
[9] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[10] Michael J. Maher,et al. Constraint Hierarchies and Logic Programming , 1989, ICLP.
[11] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[12] Pedro Meseguer,et al. Constraint Satisfaction Problems: An Overview , 1989, AI Commun..
[13] Rina Dechter,et al. Tree-Clustering Schemes for Constraint-Processing , 1988, AAAI.
[14] Roger Mohr,et al. Good Old Discrete Relaxation , 1988, ECAI.
[15] Rina Dechter,et al. Network-based heuristics for constraint satisfaction problems , 1988 .
[16] Bernard A. Nadel,et al. Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .
[17] Eugene C. Freuder. Backtrack-free and backtrack-bounded search , 1988 .
[18] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[19] Bjørn N. Freeman-Benson,et al. Constraint hierarchies , 1987, OOPSLA '87.
[20] M. Lacroix,et al. Preferences; Putting More Knowledge into Queries , 1987, VLDB.
[21] Mark S. Fox,et al. Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .
[22] W. Edwards,et al. Decision Analysis and Behavioral Research , 1986 .
[23] Jean-Claude Latombe,et al. Making Compromises Among Antagonist Constraints in a Planner , 1985, Artif. Intell..
[24] Rina Dechter,et al. The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation , 1985, IJCAI.
[25] Eugene C. Freuder,et al. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..
[26] Robert M. Haralick,et al. Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[27] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[28] R M Haralick,et al. The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.
[29] R. L. Keeney,et al. Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.
[30] Robert M. Haralick,et al. The Consistent Labeling Problem: Part I , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] John Gaschnig,et al. A General Backtrack Algorithm That Eliminates Most Redundant Tests , 1977, IJCAI.
[32] E. Reingold,et al. Combinatorial Algorithms: Theory and Practice , 1977 .
[33] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[34] Azriel Rosenfeld,et al. Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.
[35] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[36] A. Tversky. Elimination by aspects: A theory of choice. , 1972 .
[37] P. Fishburn,et al. Utility theory , 1980, Cognitive Choice Modeling.
[38] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[39] Solomon W. Golomb,et al. Backtrack Programming , 1965, JACM.
[40] William G. Cochran,et al. Experimental Designs, 2nd Edition , 1950 .