92 search results - page 15 / 19 » corr 1998 |
CORR
1998
Springer
14 years 9 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
CORR
1998
Springer
14 years 9 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
CORR
1998
Springer
14 years 9 months ago
1998
Springer
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclass...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Developers express the meaning of the domain ideas in specifically selected identifiers and comments that form the target implemented code. Software maintenance requires ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant of Matsumoto Imai cryptosystem C . However Patarin later found that Little Dragon ...