Type based service composition
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Type-Based Composition of Information Services in Large Scale Environments
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
A Multiagent System for the Reliable Execution of Automatically Composed Ad-hoc Processes
Autonomous Agents and Multi-Agent Systems
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Process Matchmaking on a P2P Environment
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Middleware 2007 Works in Progress
IEEE Distributed Systems Online
Journal of Systems and Software
Matchmaking and ranking of semantic web services using integrated service profile
International Journal of Metadata, Semantics and Ontologies
Matchmaking for semantic web services with constraints on process models
AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
EVEY: enhancing privacy of service discovery in pervasive computing
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
A tree-based approach to matchmaking algorithms for resource discovery
International Journal of Network Management
Extracting Semantic Constraint from Description Text for Semantic Web Service Discovery
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Matchmaking for covariant hierarchies
Proceedings of the 8th workshop on Aspects, components, and patterns for infrastructure software
Efficient semantic service discovery in pervasive computing environments
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Selection and ranking of propositional formulas for large-scale service directories
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
Using Bytecode Instruction Counting as Portable CPU Consumption Metric
Electronic Notes in Theoretical Computer Science (ENTCS)
Searching visual media service providers using ASN.1-based ontology reasoning
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Automated discovery of web services: an interface matching approach based on similarity measure
Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications
Efficient semantic service discovery in pervasive computing environments
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
An efficient algorithm for OWL-S based semantic search in UDDI
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Directory support for large-scale, automated service composition
SC'05 Proceedings of the 4th international conference on Software Composition
Service composition with directories
SC'06 Proceedings of the 5th international conference on Software Composition
Towards p2p-based semantic web service discovery with qos support
BPM'05 Proceedings of the Third international conference on Business Process Management
Combining uncorrelated similarity measures for service discovery
RED'10 Proceedings of the Third international conference on Resource Discovery
Semantic web services matchmaking: Semantic distance-based approach
Computers and Electrical Engineering
Hi-index | 0.00 |
It has been widely recognised that matchmaking is an important component for environments populated with heterogeneous services. Several researchers have developed powerful techniques for the matchmaking problem in general. There are also specific representation of service capabilities such as DAML-S which provide a more specific framework for matchmaking.Most approaches to matchmaking have assumed a sequential search for a service with matching capabilities. This may become intractable when the number of available services gets large. In this paper, we consider how matchmaking can be developed into service directories that can be searched and maintained efficiently. Our main contribution is to show how matchmaking with DAML-S specifications can be integrated with efficient methods forsearching and maintaining balanced directory trees. We also report on experimental results using an implementation based on generalised search trees.