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...

What remains after individuals encounter solutions to insight problems determines whether they can solve the same or similar problems on another occasion. We propose that insight problems are amenable to re-solving if they allow the recoding of a single and executable solution principle. Analysis of non-naïve participants tackling the nine-dot problem showed that many recalled only part of the ...

Search strategy is an important component of any system that uses autonomous agents to detect and neutralize mines. We describe a simple and efficient search strategy derived from research on the adaptive spatial behavior of animals. Electromagnetic sensor data are processed to obtain a discrete spatial target distribution. The target distribution is used as input for a dynamic diffusion proces...

In previous experiments 4] 5] evolution of variable length mathematical expressions containing input variables was found to be useful in nding learning rules for simple and hard supervised tasks. However, hard learning problems required special attention in terms of their need for larger size codings of the potential solutions and their ability of generalisation over the testing set. This paper...

Cinque (2002) examines those transparency effects that have been claimed to point to the existence of restructuring in French and concludes that quantifier and adverb climbing depend not on restructuring but, rather, on an irrealis context. In this paper, we show that restructuring does not play an active role in explaining the existence of en `of-it' and y `there' climbing or long movement in ...

Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strateg...

In this paper, ANN controller for maximum power point tracking of photovoltaic (PV) systems is proposed and PV modeling is discussed. Maximum power point tracking (MPPT) methods are used to maximize the PV array output power by tracking continuously the maximum power point. ANN controller with hillclimbing algorithm offers fast and accurate converging to the maximum operating point during stead...

Dynamic optimization problems challenge traditional evolutionary algorithms seriously since they, once converged, cannot adapt quickly to environmental changes. This chapter investigates the application of memetic algorithms, a class of hybrid evolutionary algorithms, for dynamic optimization problems. An adaptive hill climbing method is proposed as the local search technique in the framework o...