Martin Lange (7e5cbd34) at 15 May 12:32
partial implementation of monthly sample limit
Martin Lange (a24f419b) at 15 Mar 10:34
Martin Lange (c5b3321a) at 15 Mar 10:33
Merge branch 'fix-r-solution' into 'main'
... and 1 more commit
Martin Lange (a24f419b) at 15 Mar 10:32
fix the R solution, get all pests, rework equivalence
Jakob Jeuk (630bd915) at 07 Nov 11:43
added simple README
Adam Reichold (15d4e02f) at 22 Jul 20:12
Extend the sample helper to support ad-hoc actions like externally ...
Jakob Jeuk (3ed4a9ce) at 19 Jul 12:03
Add README.md
The order in which requirements are satisfied has no effect on the time slots which are chosen for sampling, but it can influence the aggregate sample counts as even equivalent samples are count equally for the target function. We can however still avoid enumerating all different orders by always fulfilling that requirement which needs the smallest number of samples first. Since the number of requirements determines the number of their orderings via the factorial function, this significantly reduces the search space and for example let's the R script finish in the full 27 requirement problem in under 30s.
Adam Reichold (e92ffe6b) at 18 Jun 16:22
Instead of satisfying requirements in arbitrary order, always start...
Adam Reichold (60c1fee3) at 17 Jun 17:16
Compute the time evolution of the earliest paths by considering the...
Adam Reichold (1627f1b2) at 17 Jun 15:49
Add measurement to determine the earliest path in terms of node add...
... and 2 more commits
Adam Reichold (bdf266b4) at 17 Jun 15:10
Bump locked Cargo dependencies.
Adam Reichold (1fdacd9b) at 15 Jun 22:44
Exploit commutativity of matching requirements and actions to avoid...
Adam Reichold (cafba1fa) at 15 Jun 22:06
Perfom a parallel search of the solution space by locking the best ...
... and 1 more commit
Adam Reichold (be4e0a66) at 15 Jun 17:30
Perfom a parallel search of the solution space by locking the best ...