arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.09586math.OCcs.CCcs.CLcs.NI
收藏

自适应计算系统的复杂性和任务可计算性

Complexity and mission computability of adaptive computing systems

U.S. Army Research Laboratory(美国陆军研究实验室);U.S. Military Academy(美国军事学院)

Venkat R. Dasari, Mee Seong Im, Billy Geerhart

摘要:

存在可在多项式时间内计算的计算问题的子集,由于在任务领域上缺乏高性能技术,现有算法可能无法完成这些问题。我们定义了一个确定性多项式时间复杂度类的子类称为任务类,因为许多多项式问题在任务时间内是不可计算的。通过专注于成功的军事应用的上下文中的语言的子类,我们还讨论了它们的计算和通信的限制。我们调查可行的(非)线性模型,将最大限度地减少能源和最大限度地提高内存,效率和计算能力,并提供了一个近似解内获得的计算时间使用有限的资源,使一个最优解的语言可以被确定。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑