The maximin share guarantee is, in the context of allocating indivisible goods to a set of agents, a recent fairness criterion. A solution achieving a constant approximation of this guarantee always exists and can be computed in polynomial time. We extend the problem to the case where the goods collectively received by the agents satisfy a matroidal constraint. Polynomial approximation algorith...

In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The adv...

MapReduce (MR) algorithms for maximizing monotone, submodular functions subject to a cardinality constraint (SMCC) are currently restricted the use of linear-adaptive (non-parallelizable) algorithm GREEDY. Low-adaptive do not satisfy requirements these distributed MR frameworks, thereby limiting their performance. We study SMCC problem in setting and propose first with sublinear adaptive comple...

We give algorithms for approximation by low-rank positive semidefinite (PSD) matrices. For symmetric input matrix A ∈ Rn×n, target rank k, and error parameter ε > 0, one algorithm finds with constant probability a PSD matrix Ỹ of rank k such that ‖A− Ỹ ‖2F ≤ (1+ε)‖A−Ak,+‖ 2 F , where Ak,+ denotes the best rank-k PSD approximation to A, and the norm is Frobenius. The algorithm takes time O(nnz(A...

Hepatitis B virus (HBV) pregenomic RNA contains a hairpin structure (ε) located in the preCore region, essential for viral replication. ε stability is enhanced by the presence of preCore variants and ε is recognized by the HBV polymerase (Pol). Mutations in the retrotranscriptase domain (YMDD) of Pol are associated with treatment resistance. The aim of this study was to analyze the preCore regi...

this study investigated the efficiency of wheat farms in sistan province. the data consisted of 50 samples from crop producers in the sistan region. using the simple sampling method, the data was collected by completing the questionnaires. to evaluate the farm efficiencies, the two approaches of the “data envelopment analysis” and the “optimization model including parameters to control for the ...

Multi-objective reinforcement learning involves the use of techniques to address problems with multiple objectives. To resolve this, we a hybrid multi-objective optimization method that provides mathematical guarantee all policies belonging Pareto Front can be found. The hybridization gave rise Q-Managed, which is given by ε−constraint and Q-Learning algorithm, where first limits environment dy...

We focus on the minimal time control problem for single-input control-affine systems ẋ = X(x) + u1Y1(x) in IR with fixed initial and final time conditions x(0) = x̂0, x(t f ) = x̂1, and where the scalar control u1 satisfies the constraint |u1(·)| 6 1. For these systems a concept of conjugate time tc has been defined in e.g. [3, 30, 33] in the bang-bang case. Besides, theoretical and practical iss...

Until recently, it was not known whether it was possible to sort stably (i.e., keeping equal elements in their initial order) an array of n elements using only O(n) data moves and O(1) extra space. In [13] an algorithm was given to perform this task in O(n2) comparisons in the worst case. Here, we develop a new algorithm for the problem that performs only O(n1+ε) comparisons (0 < ε ≤ 1 is any f...

Effective constrained optimization algorithms have been proposed for engineering problems recently. It is common to consider constraint violation and algorithm as two separate parts. In this study, a pbest selection mechanism integrate the current mutation strategy in problems. Based on improved method, an adaptive differential evolution approach proposed, which helps population jump out of inf...