Skip to main content
Article thumbnail
Location of Repository

Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization

By Yoo Chung and Dongman Lee

Abstract

By using different interface adapters for different methods, it is possible to construct a maximally covering web of interface adapters which incurs minimum loss during interface adaptation. We introduce a polynomial-time algorithm that can achieve this. However, we also show that minimizing the number of adapters included in a maximally covering web of interface adapters is an NP-complete problem. Key words: software engineering, interface adaptation, interoperability 1

OAI identifier: oai:CiteSeerX.psu:10.1.1.313.297
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0907.3583... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.