Gidon writes: > or rather from a programmer's perspective it tries to find a set of > parameters for a function such that that function equals a particular > value.
Sounds like a minimization algorithm. > I hope to add this to CPAN if you guys think it's worthwhile. I looked through the code very quickly, but couldn't follow the logic. As far as I can tell, you seem to be getting progressively closer to your goal by cutting your search domain by half. If I understood this correctly, it will only work on non-decreasing functions. But, I could be wrong. Are you implementing a well-known algorithm? Also, in your opinion, what would this module offer more than standard minimization techniques? > What I need to figure out is what to call it and where to put it. > > I think it is AI because to me search is AI. But then again search is > search. But search against all odds a space that is unknown > might be more > AI than searching a list. Definitely not AI. There is nothing that I see here really related to AI. I would suggest the Math:: hierarchy. --Ala
