The Real Problem Through a Selection Making an Algorithm that Minimizes the Computational Complexity
M. Sivaram1, D. Yuvaraj2, Amin Salih Mohammed3, V. Porkodi4, V. Manikandan5
1Dr. M. Sivaram, Assistant Professor, Department of Computer Networking, Lebanese French University, Erbil, Kurdistan Region, Iraq
2Dr. D. Yuvaraj, Lecturer, Department of Computer Science, Cihan University/ Duhok, Kurdistan Region, Iraq.
3Dr. Amin Salih Mohammed, Dean, College of Engineering and Computer Science, Lebanese French University, Erbil, Kurdistan Region, Iraq.
4Mrs. V. Porkodi, Assistant Professor, Department of Information Technology, Lebanese French University, Erbil, Kurdistan Region, Iraq.
5Mr. M. Manikandan, Assistant Professor, Department of Information Technology, Lebanese French University, Erbil, Kurdistan Region, Iraq.
Manuscript received on 18 December 2018 | Revised Manuscript received on 27 December 2018 | Manuscript published on 30 December 2018 | PP: 95-100 | Volume-8 Issue-2, December 2018 | Retrieval Number: B5581128218/18©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Computational complexity issues are gaining increasing attention as information search, retrieval and extraction techniques and methodologies mature. This paper presents the theoretical approach of computational complexity reduction which supports information related operations in an effective and efficient manner. Three-step approach to design paradigm will have different costs (time), will consume different amount of resource (space) and will have some inherent risk or uncertainty. To capture these aspects, we need economic models of software that take into account costs, space, uncertainty and schedule implications. To address this need for economic decision making, we have proposed a method of economic modeling of information-related operations centered on an analysis of their architecture. Although we consider that the computation problem belongs to the class of np-complete. In this paper, our objective is to solve the real problem by an decision making algorithm that minimizes the computational complexity.
Keywords: Hierarchical Modeling Methodology, Partitioning,
Scope of the Article: Problem Solving and Planning