12950 search results - page 37 / 2590 » On Optimal Timed Strategies |
187
click to vote
STOC
1994
ACM
15 years 7 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...
150
Voted
ECAL
1995
Springer
15 years 7 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...
123
Voted
PE
2006
Springer
15 years 3 months ago
2006
Springer
We consider a time-slotted queueing model where each time slot can either be an arrival slot, in which new packets arrive, or a departure slot, in which packets are transmitted an...
141
Voted
CP
2004
Springer
15 years 7 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...
124
Voted
ESA
1999
Springer
15 years 7 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...