You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Tree: c30d6d307e

main

tempestpy_adaptions

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'c30d6d307e'

${ noResults }

tempest/test

History

masawei c30d6d307e Figured out how to explicitly instantiate templates. But got bitten by std::vector<bool> as it is specialized and uses bitsets (i.e. integers) internally. Less memory but at the cost of 'oh, sorry std::vector<bool> does not return a bool&'. That again seems to be a problem for the SparseMatrix<bool> instatiation since for instance getValue returns a T&. On the one hand I don't quite know why this was never an issue before and on the other hand it prevents successful compilation. So there are different ways to settle this: - Specialize SparseMatix for bool -> possibly lots of code, but might be the best solution - Write a wrapper for std::vector that uses chars instead of booleans - Dont't use SparseMatrix<bool> Next up: Figure out the best solution for this and implement it. Former-commit-id: 83b9cfd06e		12 years ago
..
functional	Sparse matrix can now also be used without knowing the number of rows/columns/nonzeros upfront. Adapted ExplicitModelAdapter to use that capability to not explore the state space twice. Added support for Z3 to CMakeLists.txt. Added correct submatrix checks for transition rewards in MDPs. Extended a test for the ExplicitModelAdapter a bit.	12 years ago
performance	Refactored SCC-Decomposition design as a preparation step for computing maximal end components of Markov automata.	12 years ago