On the Theory of NP-Complete Problems
Journal Title: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY - Year 2013, Vol 11, Issue 4
Abstract
It is shown that the theory of NP -Ñomplete problems can't be used for the analysis of optimizing tasks.
Authors and Affiliations
S. V. Listrovoy
Keywords
Related Articles
- EP ID EP650321
- DOI 10.24297/ijct.v11i4.3132
- Views 87
- Downloads 0
A REVIEW ON DYNAMIC RESOURCE ALLOCATION BASED ON LEASE TYPES IN CLOUD ENVIRONMENT
Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. Cloud Computing is an emerging computing paradigm. It aims to share data, calculations, and service transpa...
Signal and Image Processing with Side Looking Sonar
Mines placed on the sea floor are still a vast threat in civil and military shipping. This potential risk is typically encountered by advanced sonar signal processing techniques and time consuming manual evaluation of th...
Comparative Analysis of Cross-Platform MAD Frameworks
Mobile Application Development is getting to be additionally difficult with differing stages and their product improvement packs. Lately, mobile computing has been having truly a revolution. Anyways one of the difficulti...
Forecasting based on Bayesian type models
A review of some Bayesian data analysis models is proposed, namely the models with one and several parameters. A methodology is developed for probabilistic models construction in the form of Bayesian networks using stati...
Performance Analysis of Biscuit Manufacturing Plant in Steady State Using Fuzzy Availability
This paper deals with the performance analysis of biscuit manufacturing plant consisting of six sub-systems using fuzzy availability in the steady state. These six sub-systems are arranged in series and parallel configur...