Given a set of players P, indivisible resources R, and non-negative values $$\{v_{pr}\}_{p\in r\in R}$$ , an allocation is partition R into disjoint subsets $$\{C_p\}_{p \in P}$$ so that each player p assigned the in $$C_p$$ . The max-min fair problem to determine maximizes $$\min _p \sum _{r\in C_p}v_{pr}$$ In restricted case this problem, resource r has intrinsic value $$v_r$$ $$v_{pr} = v_r$...

Superstrings have many applications in data compression and genetics. However the decision version of the shortest superstring problem is NP-complete. In this paper we examine the complexity of approximating a shortest superstring. There are two basic measures of the approximations: the compression ratio and the approximation ratio. The well known and practical approximation algorithm is the se...

In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...

in this paper a new algorithm is presented for coherent radar detection of targets, when distribution of the interference (clutter and noise) is non-gaussian. the neyman-pearson criterion is used for optimal detection and several successive received samples from a radar range cell are used for detection in the same cell. on the basis of recent empirical evidences, the interference distribution ...