In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...

Abstract A key challenge in reservoir management and other fields of engineering involves optimizing a nonlinear function iteratively. Due to the lack available gradients commercial simulators attention over last decades has been on gradient free methods or approximations. In particular, ensemble-based optimization gained popularity decade due its simplicity efficient implementation when consid...

An extension of the Gauss{Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) 2 C. This result extends a similar convergence result due to Womersley which employs ...

An efficient backtracking algorithm makes with a large dictionary and the heuristic of selecting possible a very fast program to play the SCRABBLE” Brand the move with the highest score at each turn makes a Crossword Game. The efficiency is achieved by creating data very fast program that is rarely beaten by humans. The structures before the backtracking search begins that serve program makes n...

due to the fact that the error surface of adaptive infinite impulse response (iir) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. in this case, global optimization techniques are required in order to avoid the local minima. harmony search (hs), a musical inspired metaheuristic, is a recently ...

Many applications|from planning and scheduling to problems in molecular biology| rely heavily on a temporal reasoning component. In this paper, we discuss the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's innuential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the t...

We propose a new backtracking algorithm called constraint-directed backtracking (CDBT) for solving general constraint-satisfaction problems (CSPs). CDBT and the naive backtracking (BT) share a similar style of instantiating and re-instantiating variables. They diier in that CDBT searches for an assignment to variables in a variable set from the given constraint posed on that variable set and ap...