First, my deepest and most humble apologies to Ernest. You know how you always mean to do something but you keep putting it on the back burner because it doesn't produce income and has very few repercussions if you don't do it? Well, that's what happened when Ernest and I were discussing the 1982 article on Rete. I finally went and looked up the article and Ernest was right. 20+ pages and it was a fairly good presentation. Again, my apologies.
Second, Question on JIA: On page 141 you state, "The runtime will be proportional to something like R'F'^P', where R' is a number less than R, the number of rules; F' is the number of facts that change on each iteration; and P' is a number greater than one but less than the average number of patterns per rule." So, let's say that we have 1,000 rules, an average of 10 facts change on each cycle (that's a lot from my experience) and the average number of patterns per rule is 10; again, a fairly high number but not unreasonable. (We could just say that the rules were written by a BA rather than a KE.) And let's say that my computer is a 2GHz P4, single CPU. What will be the run-time? Just as a guess, let's say that 18,000 rules will fire; which should probably figure in there somewhere. What number should we use for R'? What number should we use for P'? Just curious. Finally, have you done any tests with Jess using multiple processors? Such as a dual G5 Mac or a Sun? SDG jco James C. Owen Knowledgebased Systems Corporation Senior Consultant 6314 Kelly Circle Garland, TX 75044 972.530.2895 214.684.5272 (cell) -------------------------------------------------------------------- To unsubscribe, send the words 'unsubscribe jess-users [EMAIL PROTECTED]' in the BODY of a message to [EMAIL PROTECTED], NOT to the list (use your own address!) List problems? Notify [EMAIL PROTECTED] --------------------------------------------------------------------
