3 ms·
I simply meant the specific example they give and discuss in Fig. 1. The technique itself looks sound (and pretty cool).
by pbsd 14y ago
I simply meant the specific example they give and discuss in Fig. 1. The technique itself looks sound (and pretty cool).
- jacques_chester 14y agoRight, it's a moving target. Basically you'd adjust the cost function each time a new instruction comes along and rerun the optimiser to see what changes. Thinking about dealing with a changing search space makes me wonder what an ant colony optimiser JIT would look like. A graph of instructions, maybe? With escalating path lengths? edit: but then I need to update the graph based on the next legal instruction and voila, it looks a lot like markov chains with 0/1 probabilities :|