Share Email Print

Proceedings Paper

Optimization problems with low SWAP tactical computing
Author(s): Mee Seong Im; Venkat R. Dasari; Lubjana Beshaj; Dale Shires
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 10 May 2019
PDF: 7 pages
Proc. SPIE 11013, Disruptive Technologies in Information Sciences II, 110130G (10 May 2019); doi: 10.1117/12.2518917
Show Author Affiliations
Mee Seong Im, U.S. Military Academy (United States)
Venkat R. Dasari, U.S. Army Research Lab. (United States)
Lubjana Beshaj, Army Cyber Institute (United States)
Dale Shires, U.S. Army Research Lab. (United States)

Published in SPIE Proceedings Vol. 11013:
Disruptive Technologies in Information Sciences II
Misty Blowers; Russell D. Hall; Venkateswara R. Dasari, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?