You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
NMF demonstrates his implicit incrementalization abilities to automatically create a binary decision tree from a truth table.
Only looks at the BDT structure and creates this ones
No readme with prerequisites for installation (Installation of DotNet.Core.App 2.1 or higher is necessary)
Works after installing Dot.Net.Core.App 2.2
Prints load, initial, initialization time and memory values
Config.json only tests the models: "Test.ttmodel", "GeneratedI4O2Seed42.ttmodel", "GeneratedI8O2Seed68.ttmodel", "GeneratedI8O4Seed68.ttmodel"
Does not save the result models
Synchronization of Ports, BDD, and TruthTable classes is easy to understand
Mechanism for leaf nodes and subtrees should be explained better, hard to understand, I would prefer a flow diagram
Explain more the helper classes for synchronization as TreeAssignment, because they are the important elements in this transformation
Tree is incrementally created from each row, but cannot be proven if the results are correct because they are not saved
Has the tree dead ends if the TruthTable is not complete?
Has the test.ttmodel dead ends after the algorithm?
Good approach very interesting!
Structure
Abstract and Intro good
Background a bit general the helper classes are missing on which the complete transformations depends on
Solution I think a bit to long
Do you want to add an evaluation?
Highlight the advantages and disadvantages of the solution more in the reflection or conclusion section.
Small remarks
Page 1 last line: papes -> paper
Metrics
Does the solution use the provided benchmark structure, i.e., is a batch execution supported?
-> Yes but installation of DotNet.Core.App 2.1 or higher is needed
Can all models be transformed within 10 minutes?
-> Not the largest model (one on our machine)
What kind of result is produced? BDT, BDD, with fix order
-> Looks like BDT with fix order
Is the transformation correct?
-> NMF does not store the bdd models
-> Cannot prove if the results are correct
Metrics
-> no metrics are computed
-> From the descriptions it sound like a complete BDT without optimization
The text was updated successfully, but these errors were encountered:
As a response, I was not aware that the case description had changed. Therefore, the NMF solution only knows the original BDD model. Likewise, the solution does not print any more metrics although I agree that this would be a useful extension (and also easy to implement).
Regarding dead ends, yes, the solution wil produce dead ends in the BDD if the original truth table is not complete and sometimes even if it is. This is because there is no post-processing done. The solution does not really put a focus on optimality of the result, it is rather an excercise of integrating imperative code blocks into an incrementalized transformation.
NMF
NMF demonstrates his implicit incrementalization abilities to automatically create a binary decision tree from a truth table.
Structure
Small remarks
Metrics
-> Yes but installation of DotNet.Core.App 2.1 or higher is needed
-> Not the largest model (one on our machine)
-> Looks like BDT with fix order
-> NMF does not store the bdd models
-> Cannot prove if the results are correct
-> no metrics are computed
-> From the descriptions it sound like a complete BDT without optimization
The text was updated successfully, but these errors were encountered: