Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/9563
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sukharamwala, Palak | - |
dc.date.accessioned | 2021-01-06T04:47:05Z | - |
dc.date.available | 2021-01-06T04:47:05Z | - |
dc.date.issued | 2020-06-01 | - |
dc.identifier.uri | http://10.1.7.192:80/jspui/handle/123456789/9563 | - |
dc.description.abstract | Nowadays technology is so advanced that once an impossible tasks are reality. Echnologies and algorithms are strong enough to solve many technically challenging and complex problems. The technologies supported by algorithms are growing at an exponential rate. However, the current methods and approaches are facing multiple challenges on various fronts of data, algorithms, software, computational complexities, and energy efficiencies. Nature also faces above mentioned challenges, and it has found solutions. Formulation of solutions is available as Nature Inspired Algorithms(NIA) based on the study of nature. The set these algorithms can guide in many blind spots of technology. Identification of those blind spots, study of algorithms and how to use them in betterment of current techniques, is the purpose of this major project. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 18MCEN16; | - |
dc.subject | Computer 2018 | en_US |
dc.subject | Project Report 2018 | en_US |
dc.subject | Computer Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 18MCEN | en_US |
dc.subject | 18MCEN16 | en_US |
dc.subject | NT | en_US |
dc.subject | NT 2018 | en_US |
dc.subject | CE (NT) | en_US |
dc.title | Classification and Application of Nature Inspired Algorithms | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, CE (NT) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
18MCEN16.pdf | 18MCEN16 | 1.32 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.