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

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.
Workshop on Configuration
Acapulco (Messico)
2003
Proc. Configuration Workshop held at IJCAI 2003
IJCAI
21
26
http://www2.ilog.com/ijcai-03/
Configuration; Configuration Problem Decomposition
L. ANSELMA; D. MAGRO
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/18702
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact