Leung, Ka Lun. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 118-126). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Constraint Satisfaction and Global Constraints --- p.3 / Chapter 1.2 --- Soft Constraints --- p.4 / Chapter 1.3 --- Motivation and Goal --- p.5 / Chapter 1.4 --- Outline of the Thesis --- p.6 / Chapter 2 --- Background --- p.8 / Chapter 2.1 --- Constraint Satisfaction Problems --- p.8 / Chapter 2.1.1 --- Backtracking Tree Search --- p.10 / Chapter 2.1.2 --- Local Consistency in CSP --- p.11 / Chapter 2.1.3 --- Constraint Optimization Problem --- p.16 / Chapter 2.2 --- Weighted Constraint Satisfaction --- p.21 / Chapter 2.2.1 --- Branch and Bound Search --- p.23 / Chapter 2.2.2 --- Local Consistency in WCSP --- p.26 / Chapter 2.3 --- Global Constraints --- p.35 / Chapter 2.4 --- Flow Theory --- p.37 / Chapter 3 --- Related Work --- p.39 / Chapter 3.1 --- Handling Soft Constraints in COPs --- p.39 / Chapter 3.2 --- Global Constraints --- p.40 / Chapter 3.2.1 --- Hard Global Constraints --- p.40 / Chapter 3.2.2 --- Soft Global Constraints --- p.41 / Chapter 3.3 --- Local Consistency in Weighted CSP --- p.42 / Chapter 4 --- “Soft as Hard´ح Approach --- p.44 / Chapter 4.1 --- The General “Soft as Hard´ح Approach --- p.44 / Chapter 4.2 --- Cost-based GAC --- p.49 / Chapter 4.3 --- Empirical Results --- p.53 / Chapter 5 --- Weighted CSP Approach --- p.55 / Chapter 5.1 --- Strong 0-Inverse Consistency --- p.55 / Chapter 5.1.1 --- 0-Inverse Consistency and Strong 0-Inverse Consistency --- p.56 / Chapter 5.1.2 --- Comparison with Other Consistencies --- p.62 / Chapter 5.2 --- Generalized Arc Consistency Star --- p.65 / Chapter 5.3 --- Full Directional Generalized Arc Consistency Star --- p.72 / Chapter 5.4 --- Generalizing EDAC* --- p.78 / Chapter 5.5 --- Implementation Issues --- p.87 / Chapter 6 --- Towards A Library of Efficient Soft Global Constraints --- p.90 / Chapter 6.1 --- The allDifferent Constraint --- p.91 / Chapter 6.1.1 --- All Interval Series --- p.93 / Chapter 6.1.2 --- Latin Square --- p.95 / Chapter 6.2 --- The GCC Constraint --- p.97 / Chapter 6.2.1 --- Latin Square --- p.100 / Chapter 6.2.2 --- Round Robin Tournament --- p.100 / Chapter 6.3 --- The Same Constraint --- p.102 / Chapter 6.3.1 --- Fair Scheduling --- p.104 / Chapter 6.3.2 --- People-Mission Scheduling --- p.105 / Chapter 6.4 --- The Regular Constraint --- p.106 / Chapter 6.4.1 --- Nurse Rostering Problem --- p.110 / Chapter 6.4.2 --- Modelling Stretch() Constraint --- p.111 / Chapter 6.5 --- Discussion --- p.113 / Chapter 7 --- Conclusion and Remarks --- p.115 / Chapter 7.1 --- Contributions --- p.115 / Chapter 7.2 --- Future Work --- p.117 / Bibliography --- p.118
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_326703 |
| Date | January 2009 |
| Contributors | Leung, Ka Lun., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, x, 126 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.002 seconds