This paper addresses the problem of tuning the input and the output parameters of a fuzzy logic controller. A novel technique that combines Q( )-learning with function approximation (fuzzy inference system) is proposed. The system learns autonomously without supervision or a priori training data. The proposed technique is applied to three different pursuit–evasion differential games. The propos...

In this paper, we use a numerical method involving collocation method with third B-splines as basis functions for solving a class of singular initial value problems (IVPs) of Lane--Emden type equation. The original differential equation is modified at the point of singularity. The modified problem is then treated by using B-spline approximation. In the case of non-linear problems, we first line...

The efficiency of an image compression technique relies on the capability of finding sparse M-terms for best approximation with reduced visually significant quality loss. By ”visually significant” it is meant the information to which human observer can perceive. The Human Visual System (HVS) is generally sensitive to the contrast, color, spatial frequency...etc. This paper is concerned with the...

The analytical solution of large Markovian models is one of the major challenges in performance evaluation. Structured formalisms provide a modular description to tackle state space explosion by presenting memory-efficient solutions based on tensor algebra and specific software tools implement such solutions using iterative methods. However, even these numerical methods become unsuitable when m...

We study the prize-collecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V,E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree/cycle and the penalties of the nodes not spanned by it. In addition to being a useful theoretical tool fo...

In this paper, we propose a frequency division multiplexing (FDM) diversity waveform technique to achieve a delayDoppler response that approximates the composite ambiguity function (CAF) in a multiple target scenario. First, a channel estimate based on maximum likelihood estimation (MLE) for each subband is provided, and the signal to noise power ratio (SNR) needed to achieve the specific varia...

We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using different greedy-type algorithms. The prob...

The Chebyshev finite difference method is applied to solve a system of two coupled nonlinear Lane-Emden differential equations arising in mathematical modelling of the excess sludge production from wastewater treatment plants. This method is based on a combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The approach consists of reducing the ...

We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixedcharge counterpart of the problem. For many practical concave cost problems, the fixed-charge counterpart is a well-studied combinatorial optim...

In Scott (2002) and Congdon (2006), a new method is advanced to compute posterior probabilities of models under consideration. It is based solely on MCMC outputs restricted to single models, i.e., it is bypassing reversible jump and other model exploration techniques. While it is indeed possible to approximate posterior probabilities based solely on MCMC outputs from single models, as demonstra...