Menu

Code Commit Log


Commit Date  
[r27404] by thibautd

more efficient implementation

2014-01-13 15:22:24 Tree
[r27403] by thibautd

implement a custom population parser

- storing the population requires to much memory on a desktop
- even using the "streaming" setting of PopulationImpl remains very
slow, because of the numerous call to String.intern() to construct
activities. This is rather anoying, as this information is not needed
anywhere here.

2014-01-13 15:19:50 Tree
[r27402] by thibautd

correction of probability for second round

2014-01-13 15:19:38 Tree
[r27401] by thibautd

do not regenerate primary ties when calibrating secondary threshold

2014-01-13 15:19:24 Tree
[r27400] by thibautd

HashMap -> LinkedHashMap

2014-01-13 15:19:07 Tree
[r27399] by thibautd

remove the Tie class

there are actually only the map-based methods of SocialNetwork which are
really useful, and the Tie list took a huge amount of memory leading to
filling the heap with dense networks.

2014-01-13 15:18:52 Tree
[r27398] by thibautd

use object pool for coords

2014-01-13 15:18:28 Tree
[r27397] by thibautd

make thresholds match the returned network at the end of iteration

2014-01-13 15:18:14 Tree
[r27396] by thibautd

express "secondary threshold" in terms of "reduction"

(theta in the paper). This is better for the calibration process, as
this allows the secondary threshold to follow the evolutions of the
primary threshold.

2014-01-13 15:17:57 Tree
[r27395] by thibautd

dump evolution of thresholds in a file

2014-01-13 15:17:42 Tree
Older >
MongoDB Logo MongoDB