Abstract
This paper demonstrates how to lower the average response time of search-based interactive configurators using over and under approximations of the configuration problem represented by binary decision diagrams (BDDs) on problems where fast configurators using monolithic BDDs are intractable. The paper introduces several ways to build the approximations and our experimental evaluation on industrial data shows that a search driven extension of the approximations substantially outperforms both purely search-based and purely BDDbased interactive configurators.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration |
Forlag | AAAI Press |
Publikationsdato | 2009 |
Status | Udgivet - 2009 |
Begivenhed | 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration - Pasadena, California, USA Varighed: 11 jul. 2009 → 17 jul. 2009 |
Konference
Konference | 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration |
---|---|
Land/Område | USA |
By | Pasadena, California |
Periode | 11/07/2009 → 17/07/2009 |
Emneord
- Interactive Configurators
- Binary Decision Diagrams
- Search-Based Configuration
- Response Time Optimization
- Industrial Data Evaluation