critical values of the mapping x → f(x), i.e. the set of points {c ∈ C | ∃(xℓ)ℓ∈N ⊂ C n f(xℓ) → c, ||xℓ||||dxℓf| | → 0 when ℓ → ∞}. We prove that the global optimum of f lies in its set of generalized critical values and provide an efficient way of deciding which value is the global optimum.

. Second, interactions between objects, such as occlusions, may cause tracking errors. Third, globally-optimum tracking is hard to achieve since the combinatorial assignment problem is NP-Complete. We present a modified Multiple-Hypothesis Tracking algorithm, MHT, for globally optimum tracking of moving

pseudo-marginals in the associative case we present a polynomial time approximation scheme for global optimization provided the maximum degree is O(log n), anddiscussseveralextensions. I.

Abstract not found

We describe a branch-and-bound search algorithm for finding the exact global optimum gapped sequencestructure alignment ("threading") between a protein sequence and a protein core or structural model, using an arbitrary amino acid pair score function (e.g., contact potentials, knowledge

A country’s suitability for entry into a currency union depends on a number of economic conditions. These include, inter alia, the intensity of trade with other potential members of the currency union, and the extent to which domestic business cycles are correlated with those of the other countries. But international trade patterns and international business cycle correlations are endogenous. This paper develops and investigates the relationship between the two phenomenon. Using thirty years of data for twenty industrialized countries, we uncover a strong and striking empirical finding: countries with closer trade links tend to have more tightly correlated business cycles. It follows that countries are more likely to satisfy the criteria for entry into a currency

During the last decade, the unprecedented increase in the affordable computational power has strongly supported the development of optimization techniques for designing antennas. Among these techniques, genetic algorithm [1] and particle swarm optimization [2] could be mentioned. Most of these techniques use physical dimensions of an antenna

The problem of locating the global optimum of functions is studied in a dynamic setting. The dynamics of simple multistable systems under the influence of chaotic forcing is investigated. When the magnitude of the forcing signal decays slowly, it is shown that the system attains an equilibrium

in clustering and Hough transform are demon-strated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization. Index Terms-Mean shift, gradient descent, global optimiza-tion, Hough transform, cluster analysis, k-means clustering. I.

of the topology and branch lengths, only a few iterations are sufficient to reach an optimum. We used extensive and realistic computer simulations to show that the topological accuracy of this new method is at least as high as that of the existing maximum-likelihood programs and much higher than the performance