libsvm is really cool, even has a idi^H^H^H beginner's guide to using it ;)

do you think we could use that to make global estimates across all nodes, i.e. instead of estimating the response time for each node in the rt and then choosing the best, could we add the routingTable contents as a discrete dimension and just get a value for that from the machine?

Also, what would the cpu requirements be for the current case (dimensional vectors) if the algorithm was used on between 10 to 100 learning samples up to 500 times per second? Is adding new samples expensive? Roughly one/tenth of the queries on freenet result in data being found and we may want to adjust for that.

If its possible to use 3d vectors (3rd dimension being the node that we'll route to), we'll have only ~10 invocations per second, but the sample points will be between 500 and 5000, will that yield better cpu time?

_______________________________________________
devl mailing list
[EMAIL PROTECTED]
http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl

Reply via email to