this paper proposes a new approach for determining efficient dmus in dea models using inverse optimi-zation and without solving any lps. it is shown that how a two-phase algorithm can be applied to detect effi-cient dmus. it is important to compare computational performance of solving the simultaneous linear equa-tions with that of the lp, when computational issues and complexity analysis are a...

in this paper, a new approach for estimating the number of wideband sources is proposed which is based on rss or ism algorithms. numerical results show that the mdl-based and eit-based proposed algorithm havea much better detection performance than that in egm and aic cases for small differences between the incident angles of sources. in addition, for similar conditions, rss algorithm offers hi...

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...

Hussein search algorithm focuses on the fundamental concept of searching in computer science and aims to enhance retrieval data from various warehouses. The efficiency cloud systems is substantially influenced by manner which saved retrieved, given vast quantity being generated stored cloud. act entails systematic endeavor locating a particular item within substantial volume data, algorithms of...

classical lbp such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. in this paper, we introduce an improved lbp algorithm to solve these problems that utilizes fast pca algorithm for reduction of vector dimensions of extracted features. in other words, proffer method (fast pca+lbp) is an improved lbp algorithm that is extracted ...

Manual fingerprint classification algorithms are very time consuming, and usually not accurate. Fast and accurate fingerprint classification is essential to each AFIS (Automatic Fingerprint Identification System). This paper investigates a fingerprint classification algorithm that reduces the complexity and costs associated with the fingerprint identification procedure. A new structural algorit...

determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...