Optimization problems with low SWaP tactical Computing
No Thumbnail Available
Authors
Im, Mee Seong
Dasari, Venkat R.
Beshaj, Lubjana
Shires, Dale
Issue Date
2019
Type
Journal articles
Language
Keywords
Artificial Intelligence , Computational Complexity , Computation and Language , Networking and Internet Architecture
Alternative Title
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.
Description
Citation
Im et al., “Optimization Problems with Low SWaP Tactical Computing.” 2019.
Publisher
Cornell University