240 search results - page 9 / 48 » Using Distance Estimates in Heuristic Search |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present an approach that extends the Particle Swarm Optimization (PSO) algorithm to handle multiobjective optimization problems by incorporating the mechanism of...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we discuss the design of a highly-parallel motion estimator for real-time Scalable Video Coding (SVC). In an SVC, motion is commonly estimated bidirectionally and o...
SSDBM
2010
IEEE
14 years 24 days ago
2010
IEEE
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
AIPS
2010
13 years 10 months ago
2010
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
CAEPIA
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...