| 20 | | * '''Improve the sparse matrix data-structure ''' in MRMC, in order to simplify the access to predecessor probabilities. Additionally, the performance and memory consumption can be improved. For ideas on this topic see [attachment:proposals-2008-06.pdf David N. Jansen's proposal]. |
| 21 | | * '''Decrease memory consumption of the lumping algorithm''' by introducing a new data structure. More details can be found in [attachment:proposals-2008-06.pdf David N. Jansen's proposal]. |
| 22 | | * '''Achieve more robust code''' in MRMC. This point may consist of restricting to a standard dialect like ANSI C/ISO C90, a naming convention for functions etc., improved error checking and a fixed comment style. Additionally tools like [http://www.splint.org/ Splint] can be used to assure correct functionality. For details see [attachment:proposals-2008-06.pdf David N. Jansen's proposal]. |
| 23 | | * ... |
| | 20 | * Please mail us your ideas! |