507 search results - page 16 / 102 » Structural Matching of BPEL Processes |
ECWEB
2007
Springer
14 years 2 months ago
2007
Springer
Service matchmaking is the process of finding appropriate services for a given set of requirements. We present a novel service matchmaking approach based on the internal process o...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
ISI
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. Schema matching is a crucial task to gather information of the same domain. However, this process is still largely performed manually or semi-automatically, discouraging ...
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
In this paper we describe an approach for the verification of Web service compositions defined by sets of BPEL processes. The key aspect of such a verification is the model adopte...