912 search results - page 121 / 183 » A New Approach to Improve Particle Swarm Optimization |
FUIN
2006
14 years 10 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
CG
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
110
click to vote
TIP
2002
14 years 9 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
FOCI
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper presents an improvement to the vanilla version of the simulated annealing algorithm by using opposite neighbors. This new technique, is based on the recently propose...
122
click to vote
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Object motions can be represented as a sequence of shape deformations and translations which can be interpretated as a sequence of points in N-dimensional shape space. These space...