First-order learning systems (e.g., FOlL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and cros...

First-order learning systems (e.g., FOIL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inherent in learning first-order concepts. However, hill-climbing leaves these systems vulnerable to local maxima and local plateaus. We present a method, called relational pathfinding, which has proven highly effective in escaping local maxima and cros...

Hidden Markov Model (HMM) is a natural and highly robust statistical methodology for automatic speech recognition. It is also being tested and proved considerably in a wide range of applications. The model parameters of the HMM are essence in describing the behavior of the utterance of the speech segments. Many successful heuristic algorithms are developed to optimize the model parameters in or...

The extension of permutation statistics to labelled trees is the subject of a number of articles. Generating functions for the number of labelled trees of several types according to the number of ascents and descents are given in [4]. A functional equation satisfied by the generating function for the number of labelled trees according to the number of descents and leaves is given in [5]. Centra...

In this paper a new method of failure detection in rotating machinery is presented. It is based on a vibration time series analysis. A pure vibration signal is decomposed via the short-time Fourier transform (STFT) and new time series for each frequency bin are processed using novel approach called local maxima method. We search for local maxima because they appear in the signal if local damage...

cially in homogeneous, even-aged plantation scenarios. Airborne imagery has mainly been used for detection of individual trees using local maxima filtering, as point spread function and signal-to-noise ratio are smaller than with satellite-borne imagery. This led to the development of a novel approach to local maxima filtering for tree detection in plantation forests in KwaZulu-Natal, South Afr...

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independ...

Althdfer, I. and K.-U. Koschnick, On the deterministic complexity of searching local maxima, Discrete Applied Mathematics 43 (1993) 111~113. Lower and upper bounds for the deterministic complexity of searching local maxima in n-dimensional grids are given. The lower bound is based on an isoperimetric theorem of Bollob& and Leader.