Sciweavers

Share
WWW
2005
ACM

On optimal service selection

9 years 10 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet been extensively studied. In this paper we formalize three kinds of optimal service selection problems, based on different criteria. Then we study their complexity and implement solutions. We prove that one-time costs make the optimal selection problem computationally hard; in the absence of these costs the problem can be solved in polynomial time. We designed and implemented both exact and heuristic (suboptimal) algorithms for the hard case, and carried out a preliminary experimental evaluation with interesting results. Categories and Subject Descriptors H.3.5 [Online Information Services]: Web-based Services; F.2.2 [Nonnumerical Algorithms and Problems]: Computations on Discrete Structures General Terms Algorithms, Experimentation, Theory Keywords Service selection problem, Automatic service composition, Ser...
Piero A. Bonatti, P. Festa
Added 22 Nov 2009
Updated 22 Nov 2009
Type Conference
Year 2005
Where WWW
Authors Piero A. Bonatti, P. Festa
Comments (0)
books