by Won, Hon Wing Stephen. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 95-101). / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Constraint Satisfaction Problem --- p.1 / Chapter 1.2 --- CSP Solving Techniques --- p.2 / Chapter 1.3 --- Motivation of the Dissertation --- p.4 / Chapter 1.4 --- Overview of the Dissertation --- p.6 / Chapter 2 --- Related Work --- p.8 / Chapter 2.1 --- Heuristic Repair Method --- p.8 / Chapter 2.2 --- GSAT --- p.8 / Chapter 2.3 --- GENET --- p.9 / Chapter 2.4 --- Simulated Annealing --- p.9 / Chapter 2.5 --- Genetic Algorithms --- p.10 / Chapter 3 --- Overview of GENET --- p.11 / Chapter 3.1 --- Network Architecture --- p.11 / Chapter 3.2 --- Convergence Procedure --- p.12 / Chapter 3.3 --- The illegal and atmost Constraints --- p.13 / Chapter 3.3.1 --- The illegal Constraint --- p.14 / Chapter 3.3.2 --- The atmost Constraint --- p.14 / Chapter 3.4 --- General Non-Binary Constraints --- p.15 / Chapter 3.4.1 --- Constraint Transformation --- p.15 / Chapter 3.4.2 --- Using the illegal Constraints --- p.17 / Chapter 3.4.3 --- Problem Transformation --- p.17 / Chapter 4 --- An Extended GENET --- p.20 / Chapter 4.1 --- Network Architecture --- p.20 / Chapter 4.2 --- Convergence Procedure --- p.22 / Chapter 4.3 --- E-GENET as a Generalization of GENET --- p.24 / Chapter 4.3.1 --- Constraints --- p.30 / Chapter 4.3.2 --- Network Architecture --- p.31 / Chapter 4.4 --- Properties of E-GENET --- p.32 / Chapter 4.4.1 --- Incompleteness of E-GENET --- p.33 / Chapter 4.4.2 --- Making E-GENET Complete --- p.36 / Chapter 4.5 --- Storage Scheme --- p.38 / Chapter 4.5.1 --- The illegal and atmost Constraint --- p.39 / Chapter 4.5.2 --- The Disequality Constraint --- p.39 / Chapter 4.5.3 --- General Constraints --- p.40 / Chapter 4.6 --- Benchmarking Results --- p.40 / Chapter 4.6.1 --- The Graph-Coloring Problem --- p.41 / Chapter 4.6.2 --- The N-queens Problem --- p.42 / Chapter 4.6.3 --- The Car-Sequencing Problem --- p.43 / Chapter 4.6.4 --- The Cryptarithmetic Problem --- p.44 / Chapter 4.6.5 --- The Hamiltonian Path Problem --- p.45 / Chapter 5 --- Optimizations to E-GENET --- p.47 / Chapter 5.1 --- Inadequacies of E-GENET --- p.47 / Chapter 5.1.1 --- Cumbrous Constraint Node --- p.48 / Chapter 5.1.2 --- Inefficiency of the min-conflicts heuristic --- p.48 / Chapter 5.2 --- Optimizations --- p.50 / Chapter 5.2.1 --- Intermediate Node --- p.50 / Chapter 5.2.2 --- New Assignment Scheme of Initial Penalty Values --- p.55 / Chapter 5.2.3 --- Concept of Contribution --- p.57 / Chapter 5.2.4 --- Learning Heuristic --- p.62 / Chapter 6 --- A Comprehensive Constraint Library --- p.63 / Chapter 6.1 --- Elementary Constraints --- p.64 / Chapter 6.1.1 --- Linear Arithmetic Constraints --- p.64 / Chapter 6.1.2 --- The atmost Constraint --- p.66 / Chapter 6.1.3 --- Disjunctive Constraints --- p.69 / Chapter 6.2 --- Global Constraints --- p.71 / Chapter 6.2.1 --- The cumulative Constraint --- p.72 / Chapter 6.2.2 --- The among Constraint --- p.77 / Chapter 6.2.3 --- The diffn Constraint --- p.82 / Chapter 6.2.4 --- The cycle Constraint --- p.85 / Chapter 7 --- Conclusion --- p.89 / Chapter 7.1 --- Contributions --- p.89 / Chapter 7.2 --- Discussions --- p.90 / Chapter 7.3 --- Future Work --- p.94 / Bibliography --- p.95
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_321893 |
| Date | January 1997 |
| Contributors | Won, Hon Wing Stephen., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, viii, 102 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0022 seconds