5230 search results - page 129 / 1046 » Dynamic Optimality -- Almost |
121
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
109
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
146
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
117
Voted
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
126
Voted
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...