Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
The step size leading to the absolute minimum of the constant modulus (CM) criterion along the search direction can be obtained algebraically at each iteration among the roots of a...
This paper presents an online support vector machine (SVM) that uses the stochastic meta-descent (SMD) algorithm to adapt its step size automatically. We formulate the online lear...
S. V. N. Vishwanathan, Nicol N. Schraudolph, Alex ...
We describe the use of the discrete wavelet transform (DWT) for non-parametric linear time-invariant system identification. Identification is achieved by using a test excitation t...
A new adaptive algorithm, called LLMS, which employs an array image factor, IA , sandwiched in between two Least Mean Square (LMS) sections, is proposed for different applications ...
Jalal Abdulsayed Srar, Kah-Seng Chung, Ali Mansour
Using a directed mutation can improve the efficiency of processing many optimization problems. The first mutation operators of this kind proposed by Hildebrand [1], however, suffer...
Bit rate adaptation is one of the most important types of video transcoding. With H.264 becoming the predominant video codec of choice in video coding and streaming, prudent ratea...
Bio-PEPA is a process algebra for modelling biological systems. An important aspect of Bio-PEPA is the ability it provides to discretise concentrations resulting in a smaller, more...
An often overlooked problem in matching lies in selecting an appropriate step size. The selection of the step size for real-time applications is critical both from the point of vi...
Nathan Mekuz, Konstantinos G. Derpanis, John K. Ts...