본문 바로가기 주메뉴 바로가기
검색 검색영역닫기 검색 검색영역닫기 ENGLISH 메뉴 전체보기 메뉴 전체보기

논문

Web of lossy adapters for interface interoperability: An algorithm and NP-completeness of minimization

https://doi.org/10.1109/ICSESS.2010.5552291

  • 저자Yoo Chung; Dongman Lee
  • 학술지IEEE International Conference on Software Engineering and Service Sciences
  • 등재유형
  • 게재일자(2010)


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.


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.

이 페이지에서 제공하는 정보에 대해 만족하십니까?