Fully-Adaptive Algorithms for Long-Lived Renaming

2006 ◽  
pp. 413-427 ◽  
Author(s):  
Alex Brodsky ◽  
Faith Ellen ◽  
Philipp Woelfel
Keyword(s):  
Adaptive Algorithms ◽  
Fully Adaptive

Fully-adaptive algorithms for long-lived renaming

2011 ◽  
Vol 24 (2) ◽  
pp. 119-134 ◽  
Author(s):  
Alex Brodsky ◽  
Faith Ellen ◽  
Philipp Woelfel
Keyword(s):  
Adaptive Algorithms ◽  
Fully Adaptive

Fully-adaptive bots for first-person shooter games

2010 ◽  
Author(s):  
Jonathan Miles ◽  
Tony C. Smith
Keyword(s):  
First Person ◽  
Fully Adaptive ◽  
First Person Shooter

Adaptive algorithms in the space and time domains

1983 ◽  
Vol 130 (1) ◽  
pp. 17
Author(s):  
J.G. McWhirter ◽  
T.J. Shepherd
Keyword(s):  
Adaptive Algorithms ◽  
Space And Time ◽  
Time Domains

Adaptive Algorithms for Interferometric Processing

2020 ◽  
Vol 28 (3) ◽  
pp. 267-273
Author(s):  
E. S. Kaznacheeva ◽  
V. M. Kuz’kin ◽  
G. A. Lyakhov ◽  
S. A. Pereselkov ◽  
S. A. Tkachenko
Keyword(s):  
Adaptive Algorithms

scholarly journals Decision Tree-Based Adaptive Reconfigurable Cache Scheme

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 176
Author(s):  
Wei Zhu ◽  
Xiaoyang Zeng
Keyword(s):  
Decision Tree ◽  
Adaptive Algorithms ◽  
Memory Access ◽  
Access Time ◽  
Decision Tree Algorithm ◽  
Verilog Hdl ◽  
Tree Model ◽  
Cache Associativity ◽  
Cache Scheme ◽  
Reconfigurable Cache

Applications have different preferences for caches, sometimes even within the different running phases. Caches with fixed parameters may compromise the performance of a system. To solve this problem, we propose a real-time adaptive reconfigurable cache based on the decision tree algorithm, which can optimize the average memory access time of cache without modifying the cache coherent protocol. By monitoring the application running state, the cache associativity is periodically tuned to the optimal cache associativity, which is determined by the decision tree model. This paper implements the proposed decision tree-based adaptive reconfigurable cache in the GEM5 simulator and designs the key modules using Verilog HDL. The simulation results show that the proposed decision tree-based adaptive reconfigurable cache reduces the average memory access time compared with other adaptive algorithms.

scholarly journals Convergence and quasi-optimal cost of adaptive algorithms for nonlinear operators including iterative linearization and algebraic solver

2021 ◽  
Author(s):  
Alexander Haberl ◽  
Dirk Praetorius ◽  
Stefan Schimanko ◽  
Martin Vohralík
Keyword(s):  
Adaptive Algorithm ◽  
Adaptive Mesh Refinement ◽  
Elliptic Boundary ◽  
Mesh Refinement ◽  
Adaptive Mesh ◽  
Picard Iteration ◽  
Optimal Rate ◽  
Stopping Criteria ◽  
Element Discretization ◽  
Fully Adaptive

AbstractWe consider a second-order elliptic boundary value problem with strongly monotone and Lipschitz-continuous nonlinearity. We design and study its adaptive numerical approximation interconnecting a finite element discretization, the Banach–Picard linearization, and a contractive linear algebraic solver. In particular, we identify stopping criteria for the algebraic solver that on the one hand do not request an overly tight tolerance but on the other hand are sufficient for the inexact (perturbed) Banach–Picard linearization to remain contractive. Similarly, we identify suitable stopping criteria for the Banach–Picard iteration that leave an amount of linearization error that is not harmful for the residual a posteriori error estimate to steer reliably the adaptive mesh-refinement. For the resulting algorithm, we prove a contraction of the (doubly) inexact iterates after some amount of steps of mesh-refinement/linearization/algebraic solver, leading to its linear convergence. Moreover, for usual mesh-refinement rules, we also prove that the overall error decays at the optimal rate with respect to the number of elements (degrees of freedom) added with respect to the initial mesh. Finally, we prove that our fully adaptive algorithm drives the overall error down with the same optimal rate also with respect to the overall algorithmic cost expressed as the cumulated sum of the number of mesh elements over all mesh-refinement, linearization, and algebraic solver steps. Numerical experiments support these theoretical findings and illustrate the optimal overall algorithmic cost of the fully adaptive algorithm on several test cases.

Heuristics, abductions and adaptive algorithms : A toolbox for human decision making

2020 ◽  
Author(s):  
Nelson Mauro Maldonato ◽  
Alessandro Chiodi ◽  
Donatella di Corrado ◽  
Antonietta M. Esposito ◽  
Salvatore de Lucia ◽  
...  
Keyword(s):  
Decision Making ◽  
Adaptive Algorithms ◽  
Human Decision
Sign in / Sign up

Export Citation Format

Share Document