3775 search results - page 67 / 755 » The Expression Problem Revisited |
102
click to vote
WIA
2009
Springer
15 years 7 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 ...
127
Voted
LPAR
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
PRIB
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. With widespread use of microarray technology as a potential diagnostics tool, the comparison of results obtained from the use of different platforms is of interest. When...
86
Voted
ICCS
2007
Springer
15 years 7 months ago
2007
Springer
This paper presents a Conceptual Graph (cg) framework to the Generation of Referring Expressions (gre). Employing Conceptual Graphs as the underlying formalism allows a new rigorou...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...