3333 search results - page 353 / 667 » Optimal Power-Down Strategies |
147
click to vote
GECCO
2004
Springer
16 years 6 days ago
2004
Springer
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
213
click to vote
CASES
2003
ACM
16 years 2 days ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
168
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
212
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
204
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...