Complexity and mission computability of adaptive computing systems
There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field. We define a subclass of deterministic polynomial time complexity class called mission class, as many po...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Language: | English |
| Published: |
28-08-2018
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | There is a subset of computational problems that are computable in polynomial
time for which an existing algorithm may not complete due to a lack of high
performance technology on a mission field. We define a subclass of
deterministic polynomial time complexity class called mission class, as many
polynomial problems are not computable in mission time. By focusing on such
subclass of languages in the context for successful military applications, we
also discuss their computational and communicational constraints. We
investigate feasible (non)linear models that will minimize energy and maximize
memory, efficiency, and computational power, and also provide an approximate
solution obtained within a pre-determined length of computation time using
limited resources so that an optimal solution to a language could be
determined. |
|---|---|
| AbstractList | There is a subset of computational problems that are computable in polynomial
time for which an existing algorithm may not complete due to a lack of high
performance technology on a mission field. We define a subclass of
deterministic polynomial time complexity class called mission class, as many
polynomial problems are not computable in mission time. By focusing on such
subclass of languages in the context for successful military applications, we
also discuss their computational and communicational constraints. We
investigate feasible (non)linear models that will minimize energy and maximize
memory, efficiency, and computational power, and also provide an approximate
solution obtained within a pre-determined length of computation time using
limited resources so that an optimal solution to a language could be
determined. |
| Author | Im, Mee Seong Dasari, Venkat R Geerhart, Billy |
| Author_xml | – sequence: 1 givenname: Venkat R surname: Dasari fullname: Dasari, Venkat R – sequence: 2 givenname: Mee Seong surname: Im fullname: Im, Mee Seong – sequence: 3 givenname: Billy surname: Geerhart fullname: Geerhart, Billy |
| BackLink | https://doi.org/10.48550/arXiv.1808.09586$$DView paper in arXiv |
| BookMark | eNotj81OwzAQhH2AAxQegBN-gQSbxOv1ESL-pEpceo-29gZZyp_iUDVvT1qqOcxoRhrpuxVX_dCzEA9a5SUao55oOsZDrlFhrpxBuBGv1dCNLR_jvEjqg-xiSnHopV_r35n2sT0tQyMp0DjHA1-W2P_ItKSZu3QnrhtqE99ffCN272-76jPbfn98VS_bjMBCZrzF5zVAYQAC6VWMjjUzWPaFCxDAlSVprwz7gAB7tKi8a5Sx3mGxEY__t2eIepxiR9NSn2DqM0zxBw11R0s |
| ContentType | Journal Article |
| Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| DBID | AKY AKZ GOX |
| DOI | 10.48550/arxiv.1808.09586 |
| DatabaseName | arXiv Computer Science arXiv Mathematics arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 1808_09586 |
| GroupedDBID | AKY AKZ GOX |
| ID | FETCH-LOGICAL-a676-5c78267663566da1a1ae89e1ee67ec39d6d6944a1c05ecd866b8780c9f057c983 |
| IEDL.DBID | GOX |
| IngestDate | Mon Jan 08 05:37:21 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a676-5c78267663566da1a1ae89e1ee67ec39d6d6944a1c05ecd866b8780c9f057c983 |
| OpenAccessLink | https://arxiv.org/abs/1808.09586 |
| ParticipantIDs | arxiv_primary_1808_09586 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-08-28 |
| PublicationDateYYYYMMDD | 2018-08-28 |
| PublicationDate_xml | – month: 08 year: 2018 text: 2018-08-28 day: 28 |
| PublicationDecade | 2010 |
| PublicationYear | 2018 |
| Score | 1.7094297 |
| SecondaryResourceType | preprint |
| Snippet | There is a subset of computational problems that are computable in polynomial
time for which an existing algorithm may not complete due to a lack of high... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Computation and Language Computer Science - Computational Complexity Computer Science - Networking and Internet Architecture Mathematics - Optimization and Control |
| Title | Complexity and mission computability of adaptive computing systems |
| URI | https://arxiv.org/abs/1808.09586 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdZ2_TwMhFMdfbCcXo1FTf4bBlQgcx8Hoj9ZOOtih2wUekLho02uN_e8F7owuhoUAC4_A9wGPDwA3wgnnhWOUNciolKGmWsRIq6o2qFSQnOeHwvPX5nmpH6cZk0N-3sLY9dfbZ88Hdt0t1znU0dRajWAkRA7ZenpZ9peTBcU1tP9tl3zMUvRHJGaHcDB4d-SuH44j2Avvx3Cf51zmTm52JO3bSbJsPqIiWD5U6DnZO_IRifV2lVefoSaJCulBy90JLGbTxcOcDl8XUKsaRWtMwpsyGf6mvOUpBW0CD0E1ASvjlVdGSsuR1QG9VsrpRjM0MblPaHR1CuO0-w8TIDFD2ZhLQqyjlIjOChRMR155LrF2ZzApHW5XPZ2izbZoiy3O_6-6gP2k_JlNTYW-hPFmvQ1XMOr89rqY-Bs06XrZ |
| link.rule.ids | 228,230,782,887 |
| linkProvider | Cornell University |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Complexity+and+mission+computability+of+adaptive+computing+systems&rft.au=Dasari%2C+Venkat+R&rft.au=Im%2C+Mee+Seong&rft.au=Geerhart%2C+Billy&rft.date=2018-08-28&rft_id=info:doi/10.48550%2Farxiv.1808.09586&rft.externalDocID=1808_09586 |