66 search results - page 3 / 14 » Analyzing Completeness and Correctness of Utterances Using a... |
CADE
2008
Springer
14 years 6 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
AIPS
2010
13 years 8 months ago
2010
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
KES
2006
Springer
13 years 5 months ago
2006
Springer
For the business communication by email with cellular phones, it has an important weak point. That is to hard to tell to be utterance speed and the pitch of sounds involved in the ...
SEKE
2004
Springer
13 years 11 months ago
2004
Springer
The development of class models using the Rational Unified Process (RUP) requires complete, correct and unambiguous use case specification documents. The Use Case Driven Developmen...
GCB
1998
Springer
13 years 10 months ago
1998
Springer
Analysis of a newly sequenced bacterial genome starts with identification of protein-coding genes. Functional assignment of proteins requires the exact knowledge of protein N-term...