DocumentCode
1635208
Title
Web of lossy adapters for interface interoperability: An algorithm and NP-completeness of minimization
Author
Chung, Yoo ; Lee, Dongman
Author_Institution
Nat. Inst. for Math. Sci., Daejeon, South Korea
fYear
2010
Firstpage
95
Lastpage
98
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.
Keywords
Internet; computational complexity; open systems; NP-completeness; Web of lossy adapters; interface adaptation; interface interoperability; polynomial-time algorithm; Computer science; Conferences; Electronic mail; Heuristic algorithms; IEEE Computer Society Press; NP-complete problem; Software;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering and Service Sciences (ICSESS), 2010 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-6054-0
Type
conf
DOI
10.1109/ICSESS.2010.5552291
Filename
5552291
Link To Document