The algorithm:
Find x such that f(x) == 10 set x to 0 While f(x) is approximately 10 try x a bit higher try x bit lower which ever is closer use the concept of a bit higher and lower is by default trying to jump into the middle of domain, but you can also provide function that uses a different method. when there are multiple variables it simply takes turns adjusting them. I looked into "minimisation" and that seems to be a generic term for finding a solution to x such that f(x) == what you want it to equal. So I guess that's what I'm doing. I guess this is probably the most generic version of the algorithm but I didn't get it out of a text book. I just needed to inverse a function and realized that this would work... On Tue, 4 Jun 2002, Ala Qumsieh wrote: > > 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 > >
