The method of nearest-neighbor interchange effects local improvements in a binary tree by replacing a 4-subtree by one of its two alternatives if this improves the objective function. We extend this to k-subtrees to reduce the number of local optima. Possible sequences of k-subtrees to be examined are produced by moving a window over the tree, incorporating one edge at a time while deactivating...

This paper describes a method of a cryptanalyst for a knapsack cipher. The deciphering method is based on the application of a heuristic random search hill-climbing algorithm, together with a genetic algorithm. It is shown that such an algorithm, implemented in Matlab environment, could be used to break a knapsack cipher. Some other aspects of the problem are discussed, too.

In this paper, we generalize the models used by MacKay [1] in his analysis of evolutionary strategies that are based on sexual, rather than asexual, reproduction methods. This analysis can contribute to the understanding of the relative power of genetic algorithms over search methods based upon stochastic hill-climbing, e.g. [2], [3].

The modification of message that meets the sufficient conditions for collision is found in the last step of differential attack proposed by Wang et all. (2005) on MD4 hash algorithm. Here we show how this attack phase, finding a collision starting from the list of sufficient conditions for the collision, can be implemented using a combination of two algorithms evolutionary algorithm and hill cl...

The evolutionary multiobjective optimization technique for analog circuit optimizer is presented in this paper. the technique uses a Parallel Genetic Algorithm(PGA) to identifies multiple “good” solutions from a multiobjective fitness landscape which are tuned using a local hill-climbing algorithm. The PGA is used to provide a nature niching mechanism that has considerable computational advanta...

In this paper, we investigate a family of hill-climbing procedures related to GSAT, a greedy random hill-climbing procedure for satissability. These procedures are able to solve large and diicult satissability problems beyond the range of conventional procedures like Davis-Putnam. We explore the r^ ole of greediness, randomness and hill-climbing in the eeectiveness of these procedures. We show ...

We analyze the behavior of hill-climbing algorithms for the minimum bisection problem on instances drawn from the \planted bisection" ran-is one of the few problem distributions for which various popular heuris-tic methods, such as simulated annealing, have been proven to succeed. However, it has been open whether these sophisticated methods were necessary , or whether simpler heuristics would ...

This paper introduces a new approximate inference algorithm for credal networks. The algorithm consists of two major steps. It starts by representing the credal network as a compiled logical theory. The resulting graphical structure is the basis on which the subsequent steepest-ascent hill-climbing algorithm operates. The output of the algorithm is an inner approximation of the exact lower and ...