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 93
- Downloads 0
Information Management
Information management (IM) is the collection and management of information from one or more sources and the distribution of that information to one or more audiences. Management means the organization of and control ove...
Topology Controlled Energy Proficient Protocol for Wireless Sensor Networks
Random deployment in Wireless sensor networks lead to spatial node redundancy in close knit sensor networks. In this paper, an improved energy proficient PEGASIS based protocol (PEGASIS-TC) has been proposed. PEGASIS-TC...
Performance Evaluation of VoIP in MPLS network using NS-2
To evaluate and enhance the performance of the High-Speed Data networks some study on network technology is required to be done, it also require to simulate and verify the results and suggests the better solutions for Hi...
A Survey of multimedia videoconferencing system and a proposal for a novel hybrid cloud and P2P architecture
Technological advances of the Internet and network technology have allowed the development and deployment of new services as multipoint multimedia applications: long-distance education, IPTV, distributed games and videoc...
ARTFSC Average Relative Term Frequency Sentiment Classification
Sentiment Classification refers to the computational techniques for classifying whether the sentiments of text are positive or negative. Statistical Techniques based on Term Presence and Term Frequency, using Support Vec...