List view
There are several places in the code which can be made much more efficient by adopting existing libraries. That is, the goal of this milestone is solely to refactor the implementation to use efficient approaches such as object pools; in particular, the goal *is not* to develop novel data structures which improve efficiency... that's in a private branch ;)
No due date•0/1 issues closedCurrently, the solvers behave as black boxes. It would be very useful to expose interfaces to allow more fine-grained control over there behavior.
No due date•0/3 issues closedThis milestone will add "integration" tests which ensure all programs produce the expected output. In particular, the score program is expected to output the correct, pruned set of local scores, and the solvers are expected to output the optimal score and associated structure. (The solver implementations are deterministic, so there is not a need to check for equivalence classes.)
No due date•0/5 issues closedThis milestone will completely integrate bitsets to allow arbitrarily-sized variable sets and doubles to improve the precision of scores. The existing unit tests will be expanded to cover as many of the basic operations as possible.
No due date•0/3 issues closedThis milestone will address all of the remaining issues with migrating the code base to Eclipse.
No due date•2/3 issues closedThis milestone will add documentation to the project to ensure users can compile and run the existing solvers. It will additionally add improved algorithm pseudocode.
No due date•3/5 issues closed