SWITCHBOARD: Telephone speech corpus for research and development

JJ Godfrey, EC Holliman, J McDaniel - Acoustics, speech, and signal …, 1992 - computer.org
There are more and more Web services used in collaborative learning, hence it has become
increasingly important to locate proper Web services in an accurate and efficient way. In this …

Service selection algorithms for Web services with end-to-end QoS constraints

T Yu, KJ Lin - Information systems and e-business management, 2005 - Springer
Web services are new forms of Internet software that can be universally deployed and
invoked using standard protocols. Services from different providers can be integrated into a …

A QoS broker based architecture for efficient web services selection

MA Serhani, R Dssouli, A Hafid… - … Conference on Web …, 2005 - ieeexplore.ieee.org
Quality of service (QoS) support in Web services plays a great role for the success of this
emerging technology. In this paper, we present a QoS broker-based architecture for Web …

Combining subjective and objective QoS factors for personalized web service selection

HC Wang, CS Lee, TH Ho - Expert Systems with Applications, 2007 - Elsevier
Web service is an emerging Internet technology to dynamically describe, discover and
communicate. According to the Web Service Architecture (WSA) published by W3C, users …

A reputation and trust management broker framework for web applications

KJ Lin, H Lu, T Yu, C Tai - … on e-Technology, e-Commerce and …, 2005 - ieeexplore.ieee.org
This paper presents a distributed reputation and trust management framework that
addresses the challenges of eliciting, evaluating and propagating reputation for Web …

[PDF][PDF] 一种QoS 有保障的Web 服务分布式发现模型

郭得科, 任彦, 陈洪辉, 薛群威, 罗雪山 - 2006 - jos.org.cn
如何动态地选择, 绑定并调用最适合用户需求的Web 服务备受研究领域的关注. 提出了一种QoS
有保障的Web 服务分布式发现模型, 具体研究基于QoS 约束的服务发现问题 …

Parallel implementation of Bouvka's minimum spanning tree algorithm

S Chung, A Condon - Proceedings of International Conference …, 1996 - ieeexplore.ieee.org
We study parallel algorithms for the minimum spanning tree problem, based on the
sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are …

Contemporary web service discovery mechanisms

J Garofalakis, Y Panagis… - Journal of Web …, 2006 - journals.riverpublishers.com
The introduction of software development via Web Services has been the most significant
web engineering paradigm, in the last years. The widely acknowledged importance of the …

Adaptive algorithms for finding replacement services in autonomic distributed business processes

T Yu, KJ Lin - Proceedings Autonomous Decentralized Systems …, 2005 - ieeexplore.ieee.org
Web service may be used to construct autonomic business processes, where several Web
services interact with each other to carry out complex transactions or workflows. During the …

[PDF][PDF] Web service composition methods: A survey

E Pejman, Y Rastegari, PM Esfahani… - Proceedings of the …, 2012 - iaeng.org
Web service composition is one of the most challenging problems of recent years. The
number of service providers is increasing, and along with that for a request they offer …