recently different approaches have been developed in the field of sensor fault diagnostics based on auto-associative neural network (aann). in this paper we present a novel algorithm called self reconstructing auto-associative neural network (s-aann) which is able to detect and isolate single faulty sensor via reconstruction. we have also extended the algorithm to be applicable in multiple faul...

here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎the algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎it is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎numerical examples and a simulation study are used to...

We consider the multiprocessor scheduling problem in which one must schedule n independent tasks nonpreemptively on m identical, parallel machines, such that the completion time of the last task is minimal. For this well-studied problem the Largest Differencing Method due to Karmarkar and Karp outperforms other existing polynomial-time approximation algorithms from an averagecase perspective. F...

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the vertices in order of increasing cost, and maintains a set V of visited vertices (denoted by UsedVx in the article) whose cost from the source has been computed, and a tentative cost D(u) to each unvisited vertex u. In the article, the set of all unvisited vertices is denote...

the main challenge of a search engine is ranking web documents to provide the best response to a user`s query. despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ranks is of great importance. in this paper, a ranking algorithm based on the reinforcement le...