Opened 12 years ago
Last modified 11 years ago
#2021 closed enhancement
SymbolicExpressionTreeLinearInterpreter — at Version 3
| Reported by: | bburlacu | Owned by: | bburlacu |
|---|---|---|---|
| Priority: | low | Milestone: | HeuristicLab 3.3.9 |
| Component: | Problems.DataAnalysis.Symbolic | Version: | 3.3.9 |
| Keywords: | Cc: |
Description (last modified by bburlacu)
Initial tests show that a linear interpreter (as in, non-recursive) can bring up to a 20% increase in speed when using the type coherent grammar.
Initial implementation supports all symbols except time-lagged symbols of any kind (Integral, Derivative, TimeLag) and ADFs.
Change History (3)
comment:1 Changed 12 years ago by bburlacu
comment:2 Changed 12 years ago by bburlacu
- Description modified (diff)
comment:3 Changed 12 years ago by bburlacu
- Description modified (diff)
Note: See
TracTickets for help on using
tickets.
r9271: Initial implementation of the SymbolicDataAnalysisExpressionTreeLinearInterpreter.