Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:idus.us.es:11441/90791

Minimum maximum reconfiguration cost problem

Authors
Publication date
1 January 2016
Publisher
Springer
Doi

    Abstract

    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

    Similar works

    Full text

    thumbnail-image

    idUS. Depósito de Investigación Universidad de Sevilla

    redirect
    oaioai:idus.us.es:11441/90791
    Last time updated on 29/01/2020

    This paper was published in idUS. Depósito de Investigación Universidad de Sevilla.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.