E-Book, Englisch, 195 Seiten, eBook
Reihe: Artificial Intelligence
Navinchandra Exploration and Innovation in Design
1991
ISBN: 978-1-4612-3114-1
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
Towards a Computational Model
E-Book, Englisch, 195 Seiten, eBook
Reihe: Artificial Intelligence
ISBN: 978-1-4612-3114-1
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Weitere Infos & Material
1. Introduction and Overview.- Innovative Design.- The Thesis.- An Approach to Innovative Design.- Organization of the Book.- Summary.- 2. A Design Scenario.- The Problem.- Design Exploration.- Design Adaptation.- Assumptions of the Approach.- Summary.- 3. The Design Problem.- Design Representation.- Design as a Labeling Problem.- Representing a CLP in the Computer.- Optimization and the CLP.- Summary.- Conclusions.- 4. Design Synthesis.- Search as Enumeration.- The Example Problem Statement.- Searching for a Solution.- Looking for Optimal Consistent Labelings.- Summary.- Conclusion.- 5. Design Exploration.- A Scenario.- Exploration in Design: Some Intuitions.- The Landscape Example, Revisited.- Criteria Emergence.- Summary.- 6. Design Adaptation.- Background.- Example of Case Based Design Adaptation.- Details on Case Based Design Adaptation.- Notes on Demand Posting.- Summary.- 7. Putting It All Together: A Detailed Architecture of CYCLOPS.- Normal Search Mode.- Exploration Mode.- Adaptation Mode.- Operating CYCLOPS.- The Implementation.- 8. Relationship to Other Work.- Design as a Multi-Criteria Configuration Problem.- Design Exploration.- Design Adaptation.- Conclusions.- 9. Assumptions, Shortcomings, and Future Research.- Future Applications.- Contributions.- Epilogue.- Appendix A. The Consistent Labeling Optimization Problem.- Formulating the.- Consistent Labeling Optimization Problem.- Variables.- Values.- Constraints.- Objectives.- Solving CLPs with the Forward Checking Algorithm.- Searching the State Space.- Forward Checking and Search.- The Forward Checking Algorithm.- Solving the CLOP.- Representing Relaxable Constraints and Objectives.- Determining the Ranks for partial labelings.- An Admissible Algorithm for a CLOP.- Proof of Optimality of the CLOPS algorithm.- Conclusions.- Appendix B. A Trace of CYCLOPS in Action.- CYCLOPS Architecture.- An Example.- The problem statement.- Domain Knowledge-Base: The Precedents.- The run.- References.