Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: CPU Boundries, Buffering, & Speed Discussion

by jakeease (Friar)
on Sep 15, 2013 at 08:11 UTC ( #1054168=note: print w/ replies, xml ) Need Help??


in reply to CPU Boundries, Buffering, & Speed Discussion

Laurent_R has made some good suggestions about pruning combinations early, and Albannach has expanded on it. If you are using an algorithm to solve the knapsack problem, keep in mind that it is a notoriously difficult problem (NP Complete) and could easily put you into quadrillions if there are too many combinations.G;ive some thought to heuristic solutions; after all, in solving a knapsack problem, each item has a value and a weight. In Fantasy Football, value is subjective, or heuristic; I guess weight just means you need to choose 11 players, including certain positions. Knapsack seeks a mathematically optimal solution; fantasy seeks a heuristically satisfying lineup with a good probability of winning a game--quite different from weighing and valuing a knapsack.


Comment on Re: CPU Boundries, Buffering, & Speed Discussion

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (8)
As of 2014-08-29 10:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (277 votes), past polls