TimQu
|
b3349dc344
|
fixed fill() method of bit vectors
|
8 years ago |
dehnert
|
c84a84cba4
|
corrected ms to s
|
8 years ago |
|
dehnert
|
2d41de479e
|
added progress outputs to iterative solvers
|
8 years ago |
|
TimQu
|
142d034765
|
New methods for the SparseMatrix: SetRowGroupIndices and filterEntries
|
8 years ago |
hbruintjes
|
904e49dab3
|
Fix wrong type
|
8 years ago |
|
dehnert
|
e719a37c6c
|
fixes related to relative termination criterion
|
8 years ago |
|
dehnert
|
c5884a27b4
|
fixed termination condition applications in a number of spots, fixed uint64 vs uint64_t issue
|
8 years ago |
|
dehnert
|
c8e19d2e44
|
fixed priority queue implementation and upper reward bound computation
|
8 years ago |
|
dehnert
|
52d729b1c7
|
upper bounds computation for reachability rewards in sparse MDPs
|
8 years ago |
|
dehnert
|
b4a0016362
|
zero-reward MEC elimination for reachability rewards
|
8 years ago |
|
dehnert
|
e5572db54e
|
eliminating ECs for sound value iteration for until probabilities
|
8 years ago |
|
dehnert
|
b4bfd0c39f
|
performance improvement in DS-MPI; some cleanups
|
8 years ago |
|
dehnert
|
19ac4a360f
|
intermediate commit
|
8 years ago |
|
TimQu
|
d0209a804b
|
Setting reachable product states now also uses the transformMemoryState method
|
8 years ago |
|
dehnert
|
df0b5fbfa5
|
fixed multiply-reduce operations in the presence of empty row groups
|
8 years ago |
|
dehnert
|
ec61e110f2
|
introducing solver formats to enable linear equation solvers to take the fixed point rather than the equation system formulation
|
8 years ago |
|
dehnert
|
bac50a32ab
|
warkaround for gcc 7.2.0: make modernjson compile again
|
8 years ago |
|
dehnert
|
c5134c364f
|
Extraction and update of TBB-parallelized stuff
|
8 years ago |
|
dehnert
|
bba2832e5b
|
finished Walker-Chae method
|
8 years ago |
|
dehnert
|
5440d164b2
|
started on Walker-Chae algorithm
|
8 years ago |
|
dehnert
|
c77b9ce404
|
gauss-seidel style multiplication for gmm++
|
8 years ago |
|
dehnert
|
00f88ed452
|
gauss-seidel-style value iteration
|
8 years ago |
|
dehnert
|
dd035f7f5e
|
allow for summand in matrix-vector multiplication
|
8 years ago |
|
TimQu
|
b7e2aec82c
|
Fixed issue where variable names were reserved symbols of Exprtk
|
8 years ago |
|
TimQu
|
999fd0752c
|
The model memory product can now retrieve the reachable states without actually building the product
|
8 years ago |
|
dehnert
|
12b10af672
|
started on hybrid MDP helper respecting solver requirements
|
8 years ago |
|
dehnert
|
f327ff75e9
|
showing progress for bisimulation
|
8 years ago |
|
TimQu
|
2bccb7af78
|
modelMemoryProduct can now return the considered model and memory structure
|
8 years ago |
|
dehnert
|
ecade3f857
|
fixes issue #9 raised by Joachim Klein
|
8 years ago |
|
dehnert
|
e2e1407f3e
|
not calling sylvan_var on leaf nodes of sylvan anymore
|
8 years ago |
|
dehnert
|
5856d9fe51
|
removed some debug output
|
8 years ago |
|
dehnert
|
6bebb3c9d5
|
fix bug in rational number/function handling with sylvan
|
8 years ago |
|
dehnert
|
ee87067c9a
|
fixed type to make gcc happy
|
8 years ago |
|
dehnert
|
d2a493a92d
|
fixed several crucial bugs related to dd bisimulation, tests now passing
|
8 years ago |
|
dehnert
|
a7dcdcd84d
|
started on tests and added a ton of debug output
|
8 years ago |
|
dehnert
|
11d2ee2fda
|
making sure to add meta variables to transition matrix DD to make sure one can abstract from them later
|
8 years ago |
|
dehnert
|
36554b5b87
|
fixed some issues with reward preservation in dd-based bisimulation
|
8 years ago |
|
dehnert
|
9a6abf7eec
|
fixed a bug in dd-based reward model building
|
8 years ago |
|
dehnert
|
ad456916e9
|
first working version of sparse reward model quotienting
|
8 years ago |
|
dehnert
|
334ed077fd
|
lifted quotient extractor from ADDs to BDDs
|
8 years ago |
|
dehnert
|
f55fab0924
|
lifted representative generation from ADDs to BDDs
|
8 years ago |
|
dehnert
|
722cb3109c
|
dd quotient extraction of reward models in dd bisimulation
|
8 years ago |
|
dehnert
|
34e23f94fc
|
started on reward model preservation in DD bisimulation
|
8 years ago |
|
dehnert
|
b31fb7ab5e
|
first working version of sparse MDP quotient extraction of dd bisimulation
|
8 years ago |
|
dehnert
|
eaee50f077
|
fixed bug, implemented new sparse quotient extraction for sylvan
|
8 years ago |
|
TimQu
|
857bc63145
|
fix for model-memory-product where the mapping between (modelstate, memorystate) and productState did not work as soon as the memory structure ran out of scope
|
8 years ago |
|
TimQu
|
1f2ab1a672
|
added function BitVector::fill() which sets all bits to true
|
8 years ago |
|
dehnert
|
b7be027f7a
|
switching workplace
|
8 years ago |
|
dehnert
|
5e2ccaeeb5
|
started moving towards simpler sparse quotient extraction
|
8 years ago |
|
dehnert
|
2f97684d6d
|
fixed bug in recent optimization (only CUDD-based implementation was faulty)
|
8 years ago |
