World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

PRUNING REDUNDANT SERVICES FOR FAST SERVICE SELECTION

    https://doi.org/10.1142/S0219876213500369Cited by:1 (Source: Crossref)

    Selecting the optimal service from a mass of functionally equivalent services with low time cost is significant. Previous research addressed this issue excessively relying on several kinds of optimization algorithms. In this work, we propose an approach that prunes redundant services and reduces search space of service selection on the basis of Skyline computing and context inference. We firstly adopt Skyline computing to prune redundant services. Then, we present the notion of context service based on context inference to further reduce the size of service selection problem. Finally, mixed integer programming is employed to find the optimal service from context services according to users' Quality of Service (QoS) requirements. Experimental results on a test bed indicate that our approach can find the optimal service with low time cost.

    Remember to check out the Most Cited Articles!

    Check out these titles in finite element methods!