18 search results - page 2 / 4 » Using Local Search to Speed Up Filtering Algorithms for Some... |
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
BMCBI
2010
13 years 5 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
DCOSS
2011
Springer
12 years 4 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
ICTAI
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Genetic algorithms have been a standard technique for engineers optimising water distribution networks for some time. However in recent years there has been an increasing...