| 6 | |
| 7 | TODO: |
| 8 | * ECDF comparison view: |
| 9 | * Minimization is assumed when comparing against levels -> extract Maximization parameter from run |
| 10 | * Logscaling sometimes fails breaking the chart |
| 11 | * Test with view open and new runs arriving |
| 12 | * Add feature to calculate fixed-cost and fixed-target values and add them to the runs |
| 13 | * Analyzers: |
| 14 | * Only add new data points when BestQuality changes |
| 15 | |
| 16 | Design issues: |
| 17 | * Algorithm Execution time is hard to obtain (similar problem with the introduction of terminators) |
| 18 | * Here algorithms add this as a result |
| 19 | * ResultParameter's ActualValue property is confusing, I had to lookup usage of this parameter myself |
| 20 | * Move-based algorithms often output EvaluatedMoves, we should probably have all algorithms output EvaluatedSolutions |
| 21 | * Analyzers depend on BestAverageWorstQualityAnalyzer, in my opinion best-so-far quality and execution time are results that the algorithm itself must provide and not an analyzer |