ITU

Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Standard

Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration. / Nørgaard, Andreas Hau; Boysen, Morten Riiskjær; Jensen, Rune Møller; Tiedemann, Peter.

Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration. AAAI Press, 2009.

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

Harvard

Nørgaard, AH, Boysen, MR, Jensen, RM & Tiedemann, P 2009, Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration. in Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration. AAAI Press, 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration, Pasadena, California, United States, 11/07/2009.

APA

Nørgaard, A. H., Boysen, M. R., Jensen, R. M., & Tiedemann, P. (2009). Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration. In Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration AAAI Press.

Vancouver

Nørgaard AH, Boysen MR, Jensen RM, Tiedemann P. Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration. In Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration. AAAI Press. 2009

Author

Nørgaard, Andreas Hau ; Boysen, Morten Riiskjær ; Jensen, Rune Møller ; Tiedemann, Peter. / Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration. Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration. AAAI Press, 2009.

Bibtex

@inproceedings{57c779e0ab6911deb2ea000ea68e967b,
title = "Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration",
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.",
author = "N{\o}rgaard, {Andreas Hau} and Boysen, {Morten Riiskj{\ae}r} and Jensen, {Rune M{\o}ller} and Peter Tiedemann",
year = "2009",
language = "English",
booktitle = "Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration",
publisher = "AAAI Press",
address = "United States",
note = "null ; Conference date: 11-07-2009 Through 17-07-2009",

}

RIS

TY - GEN

T1 - Combining Binary Decision Diagrams and Backtracking Search for Scalable Backtrack-Free Interactive Product Configuration

AU - Nørgaard, Andreas Hau

AU - Boysen, Morten Riiskjær

AU - Jensen, Rune Møller

AU - Tiedemann, Peter

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Article in proceedings

BT - Proceedings of the 21st International Joint Conferences on Artificial Intelligence (IJCAI-09) Workshop on Configuration

PB - AAAI Press

Y2 - 11 July 2009 through 17 July 2009

ER -

ID: 1019297