Sciweavers

85 search results - page 2 / 17
» Efficiently finding web services using a clustering semantic...
Sort
View
ICWS
2008
IEEE
13 years 6 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
IDEAL
2010
Springer
13 years 2 months ago
An Efficient Approach to Clustering Real-Estate Listings
World Wide Web (WWW) is a vast source of information, the problem of information overload is more acute than ever. Due to noise in WWW, it is becoming hard to find usable informati...
Maciej Grzenda, Deepak Thukral
AMAST
2008
Springer
13 years 6 months ago
Service Specification and Matchmaking Using Description Logic
ed Abstract an extended abstract of [11]. Service-oriented computing is emerging as a new paradigm based on autonomous, platform-independent computational entities, called services...
M. Birna van Riemsdijk, Rolf Hennicker, Martin Wir...
VLDB
2003
ACM
160views Database» more  VLDB 2003»
14 years 4 months ago
Composing Web services on the Semantic Web
Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexibl...
Brahim Medjahed, Athman Bouguettaya, Ahmed K. Elma...
SIGSOFT
2008
ACM
14 years 5 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan