Ant colony optimization (ACO) algorithms have proved to be powerful methods to address dynamic optimization problems (DOPs). However, once the population converges to a solution and a dynamic change occurs, it is difficult for the population to adapt to
adaptive algorithmsimage segmentationmatched filtersmultispectral imagingparticle swarm optimizationremote sensingsupport vector machinesThe availability of very high resolution remotely sensed images has made the use of spectral information alone insufficient for class recognition, so the integration of spatial ...
Introducing the genetic algorithm; Exploring whether genetic algorithms are better than simulated annealing; Solving the “Packing to Mars” problem with genetic algorithms; Solving TSP and assigning deliveries to trucks with genetic algorithms; Creating
BackgroundA magic square is a matrix of equal height and width of which all sums -horizontal, vertical, and both diagonals equal the magic sum. A magic...
Several numerical techniques have been proposed in the literature to tackle the inverse problem of S-system parameterization from time series; most of them use computationally expensive meta-heuristics such as Genetic Algorithms (GA) [6–11], Simulated Annealing (SA) [12], artificial neural networks...
We apply the optimization techniques to a case study pipe network. The genetic algorithm technique finds the global optimum in relatively few evaluations compared to the size of the search space. 展开 关键词: Optimization Pipe networks Algorithms Stochastic processes Nonlinear programming ...
Finally, different algorithms may have different effects for different input resolutions, and may increase the calculation and memory occupation while improving the accuracy. In addition, although the introduction of FPN improves the performance of the algorithm, it is necessary to weigh the relationship...
展开 关键词: Markov processes fuzzy set theory genetic algorithms Markov chain compound qualification strategy fuzzy information fuzzy optimization model instructive fuzzy genetic algorithm quasilinear fuzzy numbers Compounds DOI: 10.1109/ICMLC.2008.4620459 被引量: 2 年份...
Most algorithms in this library assume that a mesh has a vertex buffer and an index buffer. For algorithms to work well and also for GPU to render your mesh efficiently, the vertex buffer has to have no redundant vertices; you can generate an index buffer from an unindexed vertex buffer or...
Convexity-Oriented Method for the Topology Optimization of Ferromagnetic Moving Parts in Electromagnetic Actuators Using Magnetic Energy When applied to the topology optimization of electromagnetic devices, gradient-based algorithms suffer from a lack of convexity. They usually converge to l... Labbe, T,...