Efficient solution methods for covering tree problems

Top ◽  
1998 ◽  
Vol 6 (2) ◽  
pp. 205-221 ◽  
Author(s):  
T. B. Boffey
Keyword(s):  
Efficient Solution ◽  
Solution Methods ◽  
Covering Tree

scholarly journals Modeling of pressure–volume controlled artificial respiration with local derivatives

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Bahar Acay ◽  
Mustafa Inc ◽  
Yu-Ming Chu ◽  
Bandar Almohsen
Keyword(s):  
Efficient Solution ◽  
Clinical Medicine ◽  
Artificial Respiration ◽  
Pd Controller ◽  
Governing Equations ◽  
Conformable Derivative ◽  
Solution Methods ◽  
Conformable Derivatives ◽  
Derivatives Of ◽  
Volume Controlled

AbstractWe attempt to motivate utilization of some local derivatives of arbitrary orders in clinical medicine. For this purpose, we provide two efficient solution methods for various problems that occur in nature by employing the local proportional derivative defined by the proportional derivative (PD) controller. Under some necessary assumptions, a detailed exposition of the instantaneous volume in a lung is furnished by conformable derivative and such modified conformable derivatives as truncated M-derivative and proportional derivative. Moreover, we wish to investigate the performance of the above-mentioned operators in applications by plotting several graphs of the governing equations.

scholarly journals Discrete-Time Networked Dynamic Systems

2020 ◽  
Vol 15 ◽  
Keyword(s):  
Graph Theory ◽  
Convex Optimization ◽  
Discrete Time ◽  
Dynamic Systems ◽  
General Framework ◽  
Efficient Solution ◽  
Heterogeneous Agent ◽  
Networked Dynamic Systems ◽  
Solution Methods

In this paper, we provides a general framework for the analysis of a class of linear discrete-time networked dynamic systems (DNDS). We focus our attention on DNDS where the underlying connection topology couples the agents at their outputs. A distinction is made between DNDS with homogeneous agent dynamics and DNDS with heterogeneous agent dynamics. It is emphasized that developing efficient solution methods for the design of such systems involve connecting and interpreting results from graph theory and convex optimization in a systems-theoretic context

scholarly journals Efficient solution of Boolean satisfiability problems with digital memcomputing

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Sean R. B. Bearden ◽  
Yan Ru Pei ◽  
Massimiliano Di Ventra
Keyword(s):  
Physical System ◽  
Efficient Solution ◽  
Boolean Satisfiability ◽  
Typical Case ◽  
Boolean Formula ◽  
Worst Case ◽  
Sat Problem ◽  
Linear Ordinary Differential Equations ◽  
System A ◽  
Solution Methods

AbstractBoolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution methods in a variety of applications. It is the decision problem of determining whether a Boolean formula has a satisfying assignment, believed to require exponentially growing time for an algorithm to solve for the worst-case instances. Yet, the efficient solution of many classes of Boolean formulae eludes even the most successful algorithms, not only for the worst-case scenarios, but also for typical-case instances. Here, we introduce a memory-assisted physical system (a digital memcomputing machine) that, when its non-linear ordinary differential equations are integrated numerically, shows evidence for polynomially-bounded scalability while solving “hard” planted-solution instances of SAT, known to require exponential time to solve in the typical case for both complete and incomplete algorithms. Furthermore, we analytically demonstrate that the physical system can efficiently solve the SAT problem in continuous time, without the need to introduce chaos or an exponentially growing energy. The efficiency of the simulations is related to the collective dynamical properties of the original physical system that persist in the numerical integration to robustly guide the solution search even in the presence of numerical errors. We anticipate our results to broaden research directions in physics-inspired computing paradigms ranging from theory to application, from simulation to hardware implementation.

Efficient Solution Methods for Strand Grid Applications

AIAA Journal ◽  
2014 ◽  
Vol 52 (2) ◽  
pp. 267-280 ◽  
Author(s):  
Aaron Katz ◽  
Andrew M. Wissink
Keyword(s):  
Efficient Solution ◽  
Solution Methods ◽  
Grid Applications
Sign in / Sign up

Export Citation Format

Share Document