Sciweavers

2905 search results - page 51 / 581
» Formal Memetic Algorithms
Sort
View
ISOLA
2010
Springer
13 years 7 months ago
A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL
We present a formal analysis of the Web Services Atomic Transaction (WS-AT) protocol. WS-AT is a part of the WS-Coordination framework and describes an algorithm for reaching agree...
Anders P. Ravn, Jirí Srba, Saleem Vighio
COLING
2010
13 years 3 months ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan
JSC
2006
81views more  JSC 2006»
13 years 8 months ago
Complexity bounds for zero-test algorithms
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
Joris van der Hoeven, John Shackell
TCS
1998
13 years 8 months ago
Parsing Schemata and Correctness of Parsing Algorithms
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
Klaas Sikkel
IEEECIT
2005
IEEE
14 years 2 months ago
Management and Retrieval of Web Services Based on Formal Concept Analysis
After introducing some basic concepts of Web services and the definition of their relationships, we formally define the problem of managing and retrieving of Web services. This pa...
Dunlu Peng, Sheng Huang, Xiaoling Wang, Aoying Zho...