Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Semi-naive Bayesian classifier
EWSL-91 Proceedings of the European working session on learning on Machine learning
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
Automatic evaluation of summaries using N-gram co-occurrence statistics
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
HHMM-based Chinese lexical analyzer ICTCLAS
SIGHAN '03 Proceedings of the second SIGHAN workshop on Chinese language processing - Volume 17
Dynamically traveling web service clustering based on spatial and temporal aspects
ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
A rule driven approach for developing adaptive service oriented business collaboration
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
| Hi-index | 0.00 |
How to composite web service is one the most important problems of Next Generation Internet (NGI) researching. In order to reuse complex service for service composition, Multi-Scale Web Service Composition (MSWC) is proposed. Inspired by word segmenting algorithm, service composition can be achieved by diving service request into several groups and mapping these groups into existed complex services. The novelty of this approach is describe service composition domain as a Hidden Hierarchy Markov Model, and service segmenting and mapping are based on service concurrent probability and logic probability respectively. MSWC is especially more effective, because if goal service already exists, this approach is transformed into a search method.