5595 search results - page 310 / 1119 » Comparing Subsumption Optimizations |
170
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
183
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered...
175
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
163
click to vote
DSVIS
2008
Springer
15 years 8 months ago
2008
Springer
Graphical rendering must be fast enough so as to avoid hindering the user perception/action loop. Traditionally, programmers interleave descriptions and optimizations to achieve su...
157
click to vote
AAAI
2006
15 years 8 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...