1999 search results - page 111 / 400 » Finding Reductions Automatically |
FUIN
2008
14 years 10 months ago
2008
We present a formalism for the automatic verification of security protocols based on multi-agent systems semantics. We give the syntax and semantics of a temporal-epistemic securit...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
We describe the use of grammars as an approach to automatic function definition in Grammatical Evolution. The automatic generation of functions allows the evolution of both the fu...
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
In the field of chip design, hardware module reuse is a standard solution to the increasing complexity of chip architecture and the pressures to reduce time to market. In the abs...
TSD
2009
Springer
15 years 4 months ago
2009
Springer
The paper describes aspects, methods and results of the development of an automatic transcription system for Catalan broadcast conversation by means of speech recognition. Emphasi...
CADE
1999
Springer
15 years 2 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...