Graph searching is one of the simplest and most widely used tools in graph algorithms. Every search method defined using some particular selection rule, analysis corresponding vertex orderings can aid greatly devising algorithms, writing proofs correctness, or recognition various families.

In the last decades, helicopter-borne electromagnetic (HEM) method became a focus of interest in the fields of mineral exploration, geological mapping, groundwater resource investigation and environmental monitoring. As a standard approach, researchers use 1-D inversion of the acquired HEM data to recover the conductivity/resistivity-depth models. Since the relation between HEM data and model ...

k is a continuously differentiable function, bounded from below, two main approaches are operational to date. The first one is based on the line-search concept which assures the global convergence of the methods. The idea is to use a quadratic model in order to generate a search direction and then find a suitable stepsize along the direction. Although it is successful at most time it does not u...

In this paper we consider a possible improvment of conjugate gradient methods commonly used for training multilayer perceptrons. These methods rely on a line search procedure which is partially responsible for the fact that only local minima are found. We propose to perform line searches along very long lines in order to nd global minima; as usual line search procedures are not suitable in this...

Genetic algorithms have attracted a good deal of interest in the heuristic search community. Yet there are several diierent types of genetic algorithms with varying performance and search characteristics. In this paper we look at 3 genetic algorithms: an elitist simple genetic algorithm, the CHC algorithm and Genitor. One problem in comparing algorithms is that most test problems in the genetic...