In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we describe a dynamic decomposition technique exploiting the compositional structure of complex objects. We show experimentally that such a decomposition can give greater improvements in the reduction of the computational effort than a static decomposition technique described in other works.
Dynamic Problem Decomposition in Configuration
ANSELMA, LUCA;MAGRO, Diego
2003-01-01
Abstract
In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we describe a dynamic decomposition technique exploiting the compositional structure of complex objects. We show experimentally that such a decomposition can give greater improvements in the reduction of the computational effort than a static decomposition technique described in other works.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
