A non-linear time lower bound for Boolean branching programs
M Ajtai - 40th Annual Symposium on Foundations of Computer …, 1999 - ieeexplore.ieee.org
We prove that for all positive integer k and for all sufficiently small/spl epsiv/> 0 if n is
sufficiently large then there is no Boolean (or 2-way) branching program of size less than …
sufficiently large then there is no Boolean (or 2-way) branching program of size less than …
Optimum decentralized choreography for web services composition
Typical solutions for Web services composition problem develop a single intermediary which
mediates or choreographs computation and communication among the existing services to …
mediates or choreographs computation and communication among the existing services to …
A framework for optimal decentralized service-choreography
We address the problem of optimizing mediator-based service composition where the
services and the desired composition (goal) functionality are represented as i/o automata …
services and the desired composition (goal) functionality are represented as i/o automata …
The socio-cultural environment in the software process modeling
ST Acuña, GE Barchini - … '99 XIX International Conference of the …, 1999 - ieeexplore.ieee.org
With regard to the increasing complexity and heterogenization of organizations, the
technological and organizational dimensions of software process modeling are passing …
technological and organizational dimensions of software process modeling are passing …
[图书][B] I/O-Automata based formal approach to Web Services Choreography
S Mitra - 2009 - search.proquest.com
Web Services are heterogeneously developed software components invoked over the
network viz. the Internet. Their main objective is to provide desired outputs in exchange of …
network viz. the Internet. Their main objective is to provide desired outputs in exchange of …