Statistics
| Branch: | Revision:

root @ master

Name Size Revision Age Author Comment
README.md 298 Bytes ee7a20cb about 3 years Leonardo Maccari some info
convergencetest.py 5.93 KB cae3507d about 3 years Leonardo Maccari now ordering makes sense in output
main.py 3.71 KB 35d79922 about 3 years Leonardo Maccari bugifix in definition of d
ov.pdf 154 KB ee7a20cb about 3 years Leonardo Maccari some info
plot_test.gnuplot 671 Bytes 9625f032 about 3 years Leonardo Maccari first usable version

Latest revisions

# Date Author Comment
ee7a20cb 08/31/2016 07:59 AM Leonardo Maccari

some info

cae3507d 08/30/2016 05:24 PM Leonardo Maccari

now ordering makes sense in output

35d79922 08/30/2016 04:47 PM Leonardo Maccari

bugifix in definition of d

39f8531f 08/30/2016 10:00 AM Leonardo Maccari

fixes sorting dict bug

565dbf64 08/30/2016 09:54 AM Leonardo Maccari

fixes overlapping dict bug

73c1ee4d 08/30/2016 09:47 AM Leonardo Maccari

add incremental mode

d0d2243d 08/26/2016 10:17 AM Leonardo Maccari

minor print difference

9625f032 08/26/2016 09:34 AM Leonardo Maccari

first usable version

0d24a326 08/24/2016 05:49 PM Leonardo Maccari

first version that computes the distnance between two cases

View all revisions | View revisions

README


This code is a tentative code for the estimation of the convergence properties of the IFIP networking paper heuristic.

Actually, it does two things, which I partially explain in the pdf ov.pdf in this folder.

Results were not excellent so I keep this code and the pdf for future reference.

Also available in: Atom