نتایج جستجو برای: multiple objective programming mop
تعداد نتایج: 1554194 فیلتر نتایج به سال:
This paper describes a new method for semi-supervised discriminative language modeling, which is designed to improve the robustness of a discriminative language model (LM) obtained from manually transcribed (labeled) data. The discriminative LM is implemented as a log-linear model, which employs a set of linguistic features derived from word or phoneme sequences. The proposed semi-supervised di...
Although population-based algorithms are robust in solving Multi-objective Optimization Problems (MOP), they often require a large number of function evaluations. In contrast, individual-solution based algorithms are fast but can be stuck in local minima. To solve these problems, we introduce a fast and adaptive local search algorithm for MOP. Our algorithm is an individual-solution algorithm w...
The paper formalizes the bandwidth allocation process over space communication systems as a Multi – Objective Programming (MOP) problem and proposes an allocation scheme based on the GOAL programming called “Minimum Distance” (MD) algorithm. The method is aimed at following the performance obtained by each station when there is no conflict among the stations to access the channel. In short, the...
This paper deals with approximate solutions of general (that is, without any convexity assumption) multi-objective optimization problems (MOPs). In this text, by reviewing some standard scalarization techniques we are interested in finding the relationships between ε-(weakly, properly) efficient points of an MOP and ε-optimal solutions of the related scalarized problem. For this purpose, the re...
A Java-based tool-supported software development and analysis framework is presented, where monitoring is a foundational principle. Expressive requirements specification formalisms can be included into the framework via logic plug-ins, allowing one to refer not only to the current state, but also to both past and future states.
This paper considers three types of risk evaluation models within supply chains: chance constrained programming (CCP), data envelopment analysis (DEA), and multi-objective programming (MOP) models. Various risks are modeled in the form of probability and simulation of specific probability distribution in risk-embedded attributes is conducted in these three types of risk evaluation models. We mo...
Data envelopment analysis (DEA) is a common technique in measuring the relative efficiency of a set of decision making units (DMUs) with multiple inputs and multiple outputs. Standard DEA models are quite limited models, in the sense that they do not consider a DMU at different times. To resolve this problem, DEA models with dynamic structures have been proposed.In a recent pape...
Multiple-input multiple-output orthogonal frequency division multiplexing with index modulation (MIMO-OFDM-IM) has recently received increased attention, due to the potential advantage balance trade-off between spectral efficiency (SE) and energy (EE). In this paper, we investigate application of MIMO-OFDM-IM millimeter wave (mmWave) communication systems, where a hybrid analogy-digital (HAD) b...
In this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. The constraints are the warehouse capacity and the batch forms of the order placements. The first objective of this problem is to find the order quantities such that the expected ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید