142 search results - page 1 / 29 » State Elimination Ordering Strategies: Some Experimental Res... |
145
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
156
click to vote
WIA
2009
Springer
15 years 12 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
174
click to vote
TCSV
2008
15 years 5 months ago
2008
In this paper, we propose a fast and optimal solution for block motion estimation based on an adaptive multilevel successive elimination algorithm. This algorithm is accomplished b...
153
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
155
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
This paper explores some simple evolutionary strategies for an elitist, steady-state Pareto-based multi-objective evolutionary algorithm. The experimental framework is based on the...