3333 search results - page 116 / 667 » Optimal Power-Down Strategies |
196
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
160
click to vote
ECAL
1995
Springer
15 years 8 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
150
click to vote
CP
2004
Springer
15 years 8 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...
133
click to vote
ESA
1999
Springer
15 years 9 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
146
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Embedded application requirements, including high performance, low power consumption and fast time to market, are uncommon in the broader domain of general purpose applications. I...