this paper presents approximate analytical solutions for nonlinear oscillators using the multi-step homotopy analysis method (msham). the proposed scheme is only a simple modification of the homotopy analysis method, in which it is treated as an algorithm in a sequence of small intervals (i.e. time step) for finding accurate approximate solutions to the corresponding problems. several illustrat...

m p p p P  2 1  and an error bound k, we are asked to find whether there exists a prefix of T whose edit distance with P is smaller than or equal to k. The edit dance between A and B is the minimum number of insertion, deletion and substitution operations needed to transform B into A[4]. This problem can be computed by using dynamic programming method [5, 14]. Many approximate string matching...

Experimental comparison of the running time of approximate string matching algorithms for the k differences problem is presented. Given a pattern string, a text string, and integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertions, deletions, changes). We consider seven algorithms based on different approaches including dynamic ...

In this paper we introduce a new method to approximate Markov perfect equilibrium in large scale dynamic stochastic games that are not amenable to exact solution due to the curse of dimensionality. The method is based on an algorithm that iterates an approximate best response operator computed via the ‘approximate linear programming’ approach. We provide results that lend theoretical support to...

COVID-19 pandemic has resulted in an inflow of patients into the hospitals and overcrowding healthcare resources. Healthcare managers increased capacities reactively by utilizing expensive but quick methods. Instead this reactive capacity expansion approach, we propose a proactive approach considering different realizations demand uncertainties future due to COVID-19. For purpose, stochastic dy...