Sciweavers

198 search results - page 10 / 40
» Learning Unary Automata
Sort
View
TSMC
2002
69views more  TSMC 2002»
13 years 8 months ago
A new learning algorithm for the hierarchical structure learning automata operating in the nonstationary S-model random environm
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
Norio Baba, Yoshio Mogami
COLT
2003
Springer
14 years 1 months ago
Learning from Uncertain Data
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ď¬...
Mehryar Mohri
AII
1989
14 years 17 days ago
Inductive Inference, DFAs, and Computational Complexity
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
Leonard Pitt
IEEECIT
2009
IEEE
14 years 3 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi