pith. machine review for the scientific record. sign in

arxiv: 1902.05070 · v1 · submitted 2019-02-13 · 💻 cs.AI · cs.CC· cs.CL· cs.NI

Recognition: unknown

Optimization problems with low SWaP tactical Computing

Authors on Pith no claims yet
classification 💻 cs.AI cs.CCcs.CLcs.NI
keywords computingoptimizationswapcomputationalefficiencyresourcesrestrictionstactical
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Accessing gluon GTMD $F^g_{1,4}$ via the $\langle\sin(2\phi)\rangle$ azimuthal asymmetry of exclusive $\pi^0$ production in $ep$ collisions

    hep-ph 2026-04 unverdicted novelty 6.0

    A light-front spectator model yields the first calculation of Im(F^g_{1,4}) and the resulting sin(2φ) asymmetry in ep → epπ⁰ at EIC kinematics.