| 书目名称 | Dynamic Flexible Constraint Satisfaction and its Application to AI Planning |
| 编辑 | Ian Miguel |
| 视频video | |
| 概述 | Methods are developed which, for the first time, are able to solve problems which both contain a dynamic component and are open to compromise if a ‘perfect’ solution does not exist.Classical artificia |
| 丛书名称 | Distinguished Dissertations |
| 图书封面 |  |
| 描述 | First, I would like to thank my principal supervisor Dr Qiang Shen for all his help, advice and friendship throughout. Many thanks also to my second supervisor Dr Peter Jarvis for his enthusiasm, help and friendship. I would also like to thank the other members of the Approximate and Qualitative Reasoning group at Edinburgh who have also helped and inspired me. This project has been funded by an EPSRC studentship, award num ber 97305803. I would like, therefore, to extend my gratitude to EPSRC for supporting this work. Many thanks to the staff at Edinburgh University for all their help and support and for promptly fixing any technical problems that I have had . My whole family have been both encouraging and supportive throughout the completion of this book, for which I am forever indebted. York, April 2003 Ian Miguel Contents List of Figures XV 1 Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1. 1 Solving Classical CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1. 2 Applicat ions of Classical CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1. 3 Limitations of Classical CSP . . . . |
| 出版日期 | Book 2004 |
| 关键词 | Constraint Satisfaction; Extension; algorithms; artificial intelligence; complexity; constraint satisfact |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-0-85729-378-7 |
| isbn_softcover | 978-1-4471-1048-4 |
| isbn_ebook | 978-0-85729-378-7 |
| copyright | Springer Verlag London Limited 2004 |
发表于 2025-3-21 19:52:27
