>>�P_best_dnf()*dnf_time(node,key)*htl+(P_dnf(node)-P_best_dnf())* >>����(dnf_time(node,key)*htl + global_success_estimate(key)) > > >If I factor correctly this works out to: > >P_dnf(node)*dnf_time(node,key)*htl+ >(P_dnf(node)-P_best_dnf())*global_success_estimate(key) >
Abbreviations to make things easier: P_best_dnf() = b dnf_time(node,key) = t htl = h P_dnf(node) = p global_success_estimate(key) = s This makes the first equation bth+(p-b)th+s Factorising 'th' out gives (b+p-b)th + s which obviously simplifies down to pth + s Filling everything back out, we get: P_dnf(node) * dnf_time(node,key) * htl + global_success_estimate(key) All mention of P_best_dnf() seems to have disappeared...either it isn't necessary, or you'll be wanting a different equation. I hope did that all ok... :P [ cruise / casual-tempest.net / transference.org ] _______________________________________________ devl mailing list [EMAIL PROTECTED] http://hawk.freenetproject.org:8080/cgi-bin/mailman/listinfo/devl
