7648 search results - page 957 / 1530 » A Data Locality Optimizing Algorithm |
172
click to vote
HICSS
2005
IEEE
16 years 8 days ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
142
click to vote
VTS
2005
IEEE
16 years 7 days ago
2005
IEEE
An automated design procedure is described for synthesizing circuits with low power concurrent error detection. It is based on pre-synthesis selection of a parity-check code follo...
167
click to vote
EGH
2005
Springer
16 years 5 days ago
2005
Springer
We present a novel method for rendering shadow volumes. The core idea of the method is to locally choose between Z-pass and Z-fail algorithms on a per-tile basis. The choice is ma...
174
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
Self-adaptation of the mutation strengths is a powerful mechanism in evolution strategies (ES), but it can fail. As a consequence premature convergence or ending up in a local opt...
175
click to vote
GECCO
2004
Springer
16 years 1 days ago
2004
Springer
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...