Minimum maximum reconfiguration cost problem
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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/90791 |
| Acceso en línea: | https://hdl.handle.net/11441/90791 https://doi.org/10.1007/s11590-015-0887-2 |
| Access Level: | acceso abierto |
| Palabra clave: | Combinatorial optimization Computational complexity NP-completeness Graphs Integer Linear Programming Reconfigurable computing |
| Sumario: | 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. |
|---|