نتایج جستجو برای: combinatorial problem

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

Journal: :رادار 0
سیداحسان بنی هاشمی حمیدرضا غفاری

the main purpose in this paper, to express strong algorithmic optimization in their ability to detect expression target of sar that use in aircraft, plane and satellites to observe the target on the ground. for this purpose,the sar technology and its applications are introduced. previous algorithms used in this field with poor diagnosis and appropriate speed is low, like means and fuzzy and pso...

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

Journal: :Transactions of the Japanese Society for Artificial Intelligence 2007

Journal: :International Journal of Computational Intelligence and Applications 2012

Journal: :Applicable Analysis and Discrete Mathematics 2009

Journal: :Proceedings of the American Mathematical Society 1970

Journal: :Moscow journal of combinatorics and number theory 2021

The original knapsack problem is well known to be NP-complete. In a multidimensional version one have decide whether $p\in \N^k$ in sumset-sum of set $X \subseteq or not. this paper we are going investigate communication complexity related this.

Journal: :Journal of Combinatorial Theory, Series A 1992

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

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