Biased covering arrays for progressive ranking and composition of Web Services
by Renee C. Bryce, Yinong Chen, Charles J. Colbourn
International Journal of Simulation and Process Modelling (IJSPM), Vol. 3, No. 1/2, 2007

Abstract: Service-oriented computing is a new software development paradigm that allows application builders to choose from many available services. The challenges are to efficiently determine which services are the most appropriate to combine into an application based on concerns such as functionalities, licensing costs, and known reliability. Group testing has addressed some issues on how to select a small subset of candidate services. We expand upon the group testing methodology with a greedy algorithm that generates biased covering arrays for interactive testing of the services selected by group testing.

Online publication date: Thu, 26-Jul-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Simulation and Process Modelling (IJSPM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com