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

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

2009-07-21

arxiv.org/abs/0907.3583v1

Proc. of ICSESS 2010

Computer Science

Software Engineering

7 pages

Scientific paper

10.1109/ICSESS.2010.5552291

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.

Affiliated with

Also associated with

No associations

Rating

Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Web of Lossy Adapters for Interface Interoperability: An Algorithm and NP-completeness of Minimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175525