Optimization problems with low SWAP tactical computing

Mee Seong Im; Venkat R. Dasari; Lubjana Beshaj; Dale Shires

doi:10.1117/12.2518917

10 May 2019 Optimization problems with low SWAP tactical computing

Mee Seong Im, Venkat R. Dasari, Lubjana Beshaj, Dale Shires

Proceedings Volume 11013, Disruptive Technologies in Information Sciences II; 110130G (2019) https://doi.org/10.1117/12.2518917
Event: SPIE Defense + Commercial Sensing, 2019, Baltimore, MD, United States

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.

Citation Download Citation

Mee Seong Im, Venkat R. Dasari, Lubjana Beshaj, and Dale Shires "Optimization problems with low SWAP tactical computing", Proc. SPIE 11013, Disruptive Technologies in Information Sciences II, 110130G (10 May 2019); https://doi.org/10.1117/12.2518917

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available