11 search results - page 2 / 3 » NFA Reduction Algorithms by Means of Regular Inequalities |
18
Voted
WIA
2004
Springer
14 years 24 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
EC
2008
13 years 7 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
TNN
2008
13 years 7 months ago
2008
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...