15485 search results - page 2619 / 3097 » Computing Optimal Subsets |
192
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
206
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
222
click to vote
FPL
2004
Springer
15 years 10 months ago
2004
Springer
A recent trend towards integrating FPGAs with many heterogeneous components, such as memory systems, dedicated multipliers, etc., has made them an attractive option for implementin...
184
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
213
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...