Mavo
|
64699a7bad
|
Several improvements
Former-commit-id: 047ebde33b
|
9 years ago |
|
Mavo
|
a2c484bba4
|
Support for probability approximation without modularisation
Former-commit-id: 921c8d310c
|
9 years ago |
|
Mavo
|
c12bbe2904
|
Disable old way of computing permutations as there is a bug for >31 elements
Former-commit-id: ae7af404f3
|
9 years ago |
|
Mavo
|
58f8707293
|
Tighter over-approximation
Former-commit-id: 824e74f88d
|
9 years ago |
|
Mavo
|
a624292ece
|
Output no states
Former-commit-id: d1548bb3fb
|
9 years ago |
|
Mavo
|
1bfd974795
|
Minor fixes
Former-commit-id: 9344ebe5aa
|
9 years ago |
|
Mavo
|
4a6f53031e
|
Choose different approximation heuristics
Former-commit-id: e9ddae066b
|
9 years ago |
|
Mavo
|
faadf19228
|
Approximation error is relative to mean of lower and upper bound
Former-commit-id: f01c027a3a
|
9 years ago |
|
Mavo
|
a419cb0d80
|
Fixed computing rates for lower and upper bound
Former-commit-id: 89846a9788
|
9 years ago |
|
Mavo
|
6faa7f0429
|
Abort when getting infinity in approximation
Former-commit-id: 8bfda3656a
|
9 years ago |
|
Mavo
|
6b7bf3bba7
|
Introduced heuristic depth with distance from initial state
Former-commit-id: 1b94ebc4f9
|
9 years ago |
|
Mavo
|
aab45d4eab
|
Naive iterative refinement of approximation
Former-commit-id: e1620cdefd
|
9 years ago |
|
Mavo
|
d3d360b50a
|
First version of DFT approximation
Former-commit-id: 1d95ad4914
|
9 years ago |
|
Mavo
|
cfc082417b
|
Refactoring
Former-commit-id: b3896c45a4
|
9 years ago |
