This paper presents an algorithm to compute an optimal (s, S) policy under standard assumptions (stationary data, well-behaved one-period costs, discrete demand, full backlogging, and the average-cost criterion). The method is iterative, starting with an arbitrary, given (s, S) policy and converging to an optimal policy in a finite number of iterations. Any of the available approximations can t...

Given a multiset of n positive integers, the NP-complete problem of number partitioning is to assign each integer to one of k subsets, such that the largest sum of the integers assigned to any subset is minimized. Last year, three different papers on optimally solving this problem appeared in the literature, two from the first two authors, and one from the third author. We resolve here competin...

web usage mining (wum) is the automatic discovering of hidden informationof user access pattern from the web log data. frequent pattern discovery is one ofthe main techniques in wum that can be used to implement recommender systems,forecast user`s navigational behaviour, and personalize web sites. many algorithmshave been suggested on obtaining frequent user navigation patterns. this paperprese...

S. Sathyanarayana, P. Aksit, A. Arepally, P. Karmarkar, M. Solaiyappan, E. Atalar Electrical and Computer Engineering, Johns Hopkins University, Baltimore, Maryland, United States, Global Applied Science Laboratory, GE Healthcare, Milwaukee, Wisconsin, United States, Radiology, Johns Hopkins Medical Institutes, Baltimore, Maryland, United States, Electrical and Computer Engineering, Bilkent Uni...

23] C.L. Monma and A.J. Morton. Computational experimental with a dual aane variant of Karmarkar's method for linear programming. extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence. Techni-28] J. Renegar. A polynomial-time algorithm based on Newton's method for linear programming. Implementing an interior point method...

We consider the problem of partitioning a set of n numbers into m subsets of cardinality k n m or n m , such that the maximum subset sum is minimal. We prove that the performance ratios of the Differencing Method of Karmarkar and Karp for k 3 4 5 and 6 are precisely 4/3, 19/12, 103/60, and 643/360, respectively, by means of a novel approach in which the ratios are explicitly calculated using mi...

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...