Sciweavers

240 search results - page 18 / 48
» Using Distance Estimates in Heuristic Search
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
JAIR
2010
167views more  JAIR 2010»
13 years 8 months ago
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
Silvia Richter, Matthias Westphal
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 3 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
ICIP
2010
IEEE
13 years 8 months ago
A fast accurate implicit polynomial fitting approach
This paper presents a novel hybrid approach that combines state of the art fitting algorithms: algebraic-based and geometric-based. It consists of two steps; first, the 3L algorit...
Mohammad Rouhani, Angel Domingo Sappa
SEBD
1997
158views Database» more  SEBD 1997»
13 years 11 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...