Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration
Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration |
Publisher | AAAI Press |
Publication date | 2009 |
Publication status | Published - 2009 |
Event | 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration - Pasadena, California, United States Duration: 11 Jul 2009 → 17 Jul 2009 |
Conference
Conference | 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration |
---|---|
Land | United States |
By | Pasadena, California |
Periode | 11/07/2009 → 17/07/2009 |
Downloads
No data available
ID: 1019297