Sciweavers

988 search results - page 49 / 198
» Pseudo-Genetic Algorithmic Composition
Sort
View
ICWS
2008
IEEE
14 years 11 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
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
15 years 4 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
ICSOFT
2007
14 years 11 months ago
An Algorithm for Automatic Service Composition
Telecommunication companies are struggling to provide their users with value-added services. These services are expected to be context-aware, attentive and personalized. Since it i...
Eduardo Goncalves da Silva, Luís Ferreira P...
CEC
2010
IEEE
14 years 10 months ago
A penalty-based genetic algorithm for the composite SaaS placement problem in the Cloud
— Cloud computing is a latest new computing paradigm where applications, data and IT services are provided over the Internet. Cloud computing has become a main medium for Softwar...
Zeratul Izzah Mohd Yusoh, Maolin Tang
CEC
2009
IEEE
15 years 1 months ago
Direct and explicit building blocks identification and composition algorithm
— This paper proposes a new algorithm to identify and compose building blocks based on minimum mutual information criterion. Building blocks are interpreted as common subsequence...
Chalermsub Sangkavichitr, Prabhas Chongstitvatana