Abstract

A problem of combining multiple Web services to satisfy a single task, known as Web service composition problem, has received much attention recently. In real applications, there are several relevant Web services for each goal, so the search space for such a problem is huge. In this paper, we propose a novel heuristic distance measure for directing a backward search algorithm. Proposed distance measure also considers non-functional user preferences and makes significant improvement in performance of Web service composition.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call