Given a configuration of parameters that satisfies a set of constraints, and given external changes that change and fix the value of some parameters making the configuration invalid, the problem of interactive reconfiguration is to assist a user to interactively reassign a subset of the parameters to reach a consistent configuration again. In this paper, we present two BDD-based algorithms for solving the problem, one based on a monolithic BDD-representation of the solution space and another using a set of BDDs. We carry out experiments on a set of power supply restoration benchmarks and show that the set-of-BDDs algorithm scales much better. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hadzic, T., & Andersen, H. R. (2005). Interactive reconfiguration in power supply restoration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 767–771). https://doi.org/10.1007/11564751_61
Mendeley helps you to discover research relevant for your work.