Huff curves are well known for efficient arithmetics to their group law. In this paper, we propose two deterministic encodings from Fq to generalized Huff curves. When q ≡ 3 (mod 4), the first deterministic encoding based on Skalpa’s equality saves three field squarings and five multiplications compared with birational equivalence composed with Ulas’ encoding. It costs three multiplications les...

In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...

in this paper, firstly by using a mixed linear programming a new model of locating facilities with limited capacity is presented to design a closed-loop supply chain in a multi-product and multi-period mode. then, using a robust optimization approach, the proposed model decreases in non-deterministic expansion. the results show that the proposed model can handle facility capacity in a closed lo...

We study the convergence and asymptotic normality of a generalized form of stochastic approximation algorithm with deterministic perturbation sequences. Both one-simulation and two-simulation methods are considered. Assuming a special structure of deterministic sequence, we establish sufficient condition on the noise sequence for a.s. convergence of the algorithm. Construction of such a special...

In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...

Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic finite automata, where the conditions for merging states can be efficiently computed. The matter is more complex in the case of non-deterministic finite automata, where merging states can be done in different ways, and the...

We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the linear deterministic model fails to capture the phase of received signals, and there...

It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and small. In this work, we introduce a new width notion that applies to non-deterministic conformant and contingent problems as well. We also develop a belief tracking algorithm for non-deterministic problems that is exp...