Artículo
Minimum maximum reconfiguration cost problem
Autor/es | Senhadji Navarro, Raouf
García Vargas, Ignacio |
Departamento | Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores |
Fecha de publicación | 2016 |
Fecha de depósito | 2019-12-10 |
Publicado en |
|
Resumen | This paper discusses the problem of minimizing the reconfiguration cost of
some types of reconfigurable systems. A formal definition of the problem and a proof
of its NP-completeness are provided. In addition, an Integer ... This paper discusses the problem of minimizing the reconfiguration cost of some types of reconfigurable systems. A formal definition of the problem and a proof of its NP-completeness are provided. In addition, an Integer Linear Programming formulation is proposed. The proposed problem has been used for optimizing a design stage of Finite Virtual State Machines. |
Cita | Senhadji Navarro, R. y García Vargas, I. (2016). Minimum maximum reconfiguration cost problem. Optimization letters, 10 (3), 605-617. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Minimum maximum reconfiguration ... | 259.3Kb | [PDF] | Ver/ | |