neural network is one of the most widely used algorithms in the field of machine learning, on the other hand, neural network training is a complicated and important process. supervised learning needs to be organized to reach the goal as soon as possible. a supervised learning algorithm analyzes the training data and produces an inferred function, which can be used for mapping new examples.  hen...

In this paper, optimization of the backstepping controller parameters in a grid-connected single-phase inverter is studied using Imperialist competitive algorithm (ICA), Genetic Algorithm (GA) and Particle swarm optimization (PSO) algorithm. The controller is developed for the system based on state-space averaged model. By selection of a suitable Lyapunov function, stability of the proposed con...

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Barta...

In the online bidding problem, a bidder is trying to guess a positive number T , by placing bids until the value of the bid is at least T . The bidder is charged with the sum of the bids. In the bounded online bidding problem, a parameter k is given, and the bidder is charged only with the largest k bids. It is known that the online bidding problem admits a 4-competitive deterministic algorithm...

e a lower bound which converges to ~ as m goes to infinity. Prior to this work, no randomized algorithm for m > 2 was known. A randomized algorithm for m ~ 3 is presented. It achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295 and 1.81681, for m = 3 , . . . , 7 respectively. These competitive ratios are less than the best deterministic lower bound for m = 3,4, 5 and less than the ...

Overview Over the past ten years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an optimal ooine algorithm and Karlin, Manasse, Rudolph and Sleator (1988) coined the term comp...