نتایج جستجو برای: subset

تعداد نتایج: 100145  

Ghasem Tohidi Shabnam Razavyan

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

Journal: :international journal of group theory 0
mohammad zarrin university of kurdistan

let $g$ be a group and $mathcal{n}$ be the class of all nilpotent groups. a subset $a$ of $g$ is said to be nonnilpotent if for any two distinct elements $a$ and $b$ in $a$, $langle a, brangle notin mathcal{n}$. if, for any other nonnilpotent subset $b$ in $g$, $|a|geq |b|$, then $a$ is said to be a maximal nonnilpotent subset and the cardinality of this subset (if it exists) is denoted by $ome...

Journal: :Operations Research Letters 2015

Journal: :Discrete Mathematics 2002

Journal: :Discrete Mathematics 2008

Journal: :IEEE Communications Letters 2013

Journal: :Security and Communication Networks 2017

Journal: :International Journal for Uncertainty Quantification 2021

Computational cost often hinders the calibration of complex computer models. In this context, history matching (HM) is becoming a widespread strategy, with applications in many disciplines. HM uses statistical approximation, also known as an emulator, to model output, order mitigate computational cost. The process starts observation physical system. It then produces progressively more accurate ...

Journal: :The Journal of Logic Programming 1992

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید