A modified form of steepest ascent local search is proposed that displays an average complexity of O(1) time per move for NKLandscape problems. The algorithm uses a Walsh decomposition to identify improving moves. In addition, it is possible to compute a Hamming distance 2 statistical lookahead: if x is the current solution and y is a neighbor of x, it is possible to compute the average evaluat...

In this work, a new interconnect structure is proposed for the first time where copper-carbon nanotube composite encapsulated by graphene barrier layers named here as (Cu-carbon) hybrid interconnects. The motivation behind to utilize enhanced conductivity of (Cu-CNT) and improved reliability copper-graphene (Cu-GNR) in order build better possible replacement copper interconnects near future VLS...

This paper presents a new pel recursive motion compensated prediction algorithm for video coding applications. The derivation of the algorithm is based on Recursive Least Squares (RLS) estimation that minimizes the mean square prediction error for each pel (picture element). A comparison with the modified Steepest-descent gradient estimation algorithm shows significant improvement in terms of m...

Steepest Descent. Discrete Iterative Optimization. Markov Chain Monte Carlo (MCMC). NOTE: NOT FOR DISTRIBUTION!!