Optimization problems with low SWaP tactical Computing

2019/02/13 by Im, Mee Seong, Dasari, Venkat R., Beshaj, Lubjana +1 · 1 citation
#Artificial Intelligence (cs.AI) #Computation and Language (cs.CL) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI)

paper · doi:10.48550/arxiv.1902.05070

Abstract

In a resource-constrained, contested environment, computing resources need to be aware of possible size, weight, and power (SWaP) restrictions. SWaP-aware computational efficiency depends upon optimization of computational resources and intelligent time versus efficiency tradeoffs in decision making. In this paper we address the complexity of various optimization strategies related to low SWaP computing. Due to these restrictions, only a small subset of less complicated and fast computable algorithms can be used for tactical, adaptive computing.

Cited by

• High Clockrate Free-space Optical In-Memory Computing

Related

• Fundamental Resource Trade-offs for Encoded Distributed Optimization
• Complexity and mission computability of adaptive computing systems
• Practical, Utilitarian Algorithm Configuration
• Implementing Optimization-Based Control Tasks in Cyber-Physical Systems With Limited Computing Capacity
• Flexible Optimization for Cyber-Physical and Human Systems