Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^3: Average Price Algorithm

by repellent (Priest)
on Jan 28, 2009 at 17:28 UTC ( [id://739653]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Average Price Algorithm
in thread Average Price Algorithm

    The standard NP-Complete routine I use (when lacking a problem or domain specific optimization) is a recursive solution that tries to cover all combinatorial possibilities, but will short circuit (prune the tree) in the case where the fitness function would never succeed from that point on.

I have something similar with a variation of fitness() except that the function does all the heavy-lifting of driving the moves:

Re: How can I calculate the right combination of postage stamps? (combinatoric n Choose k with conditions)

Replies are listed 'Best First'.
Re^4: Average Price Algorithm
by camelcom (Sexton) on Jan 28, 2009 at 18:50 UTC
    Thanks for all the suggestions so far - I'm investigating them all.

    I'm looking for an error of less than 0.001 from the actual average for all buckets (unless the bucket has < 3 or 4 allocations) and the timeframe is less than 3 seconds on a new linux blade.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://739653]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others learning in the Monastery: (2)
As of 2024-04-26 00:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found