4433 search results - page 109 / 887 » Dynamic Optimization of Micro-Operations |
MVA
1998
13 years 9 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
CORR
2007
Springer
13 years 8 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...
GECCO
2009
Springer
14 years 2 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...
GECCO
2003
Springer
14 years 1 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...
EVOW
2009
Springer
14 years 2 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...