168 search results - page 5 / 34 » Dynamic Programming Algorithms for Transition-Based Dependen... |
PLDI
1997
ACM
15 years 1 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
ISSTA
2010
ACM
15 years 1 months ago
2010
ACM
Program control dependence has substantial impact on applications such as dynamic information flow tracking and data lineage tracing (a technique tracking the set of inputs that ...
126
click to vote
CPM
1998
Springer
15 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...
ICS
1993
Tsinghua U.
15 years 1 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...