1927 search results - page 70 / 386 » UMDAs for dynamic optimization problems |
108
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
137
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
95
Voted
GREC
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a solution for online composite sketchy shape recognition. The kernel of the strategy treats both stroke segmentation and sketch recognition as an optimization ...
MVA
1998
15 years 2 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 ...
112
click to vote
CCE
2004
15 years 14 days ago
2004
In this paper we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which these problems have bee...