413 search results - page 18 / 83 » On Solving Geometric Optimization Problems Using Shortest Pa... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
OTM
2010
Springer
13 years 5 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
ICIP
1997
IEEE
14 years 9 months ago
1997
IEEE
Anisotropic diffusion is a powerful method for image feature extraction in which blurring is allowed to occur except at edges. Mean field annealing (MFA) is an image optimization ...
INFORMATICALT
2006
13 years 7 months ago
2006
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...