Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization
Yoo Chung, Dongman Lee
TL;DR
This paper presents a polynomial-time algorithm for constructing a maximally covering web of lossy interface adapters to optimize interoperability, and proves that minimizing the number of adapters is NP-complete.
Contribution
It introduces a polynomial-time algorithm for maximizing interface coverage and establishes NP-completeness for adapter minimization.
Findings
Polynomial-time algorithm for maximally covering web of adapters
Proof of NP-completeness for adapter minimization
Enhanced understanding of interface adapter optimization
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.