Results 91 to 100 of about 41,858 (279)
Full Dollarisation and Economic Performance Revisited
ABSTRACT This paper examines the economic performance of fully dollarised economies compared to those with alternative monetary regimes. Using an extensive dataset covering 192 countries from 1980 to 2021, we employ a variety of econometric techniques, including joint maximum likelihood and propensity score matching, to address endogeneity and ...
John Thornton, Chrysovalantis Vasilakis
wiley +1 more source
Some Mathematical Facts About Optimal Cache Replacement [PDF]
This article exposes and proves some mathematical facts about optimal cache replacement that were previously unknown or not proved rigorously. An explicit formula is obtained, giving OPT hits and misses as a function of past references. Several mathematical facts are derived from this formula, including a proof that OPT miss curves are ...
openaire +2 more sources
ABSTRACT Exposure and response prevention (ERP) remains the gold‐standard psychotherapy for obsessive–compulsive disorder (OCD), yet real‐world care is limited by dropout, partial response, relapse, and phenotypes that strain habituation‐centric protocols.
Jakob Fink‐Lamotte
wiley +1 more source
Analyzing Adaptive Cache Replacement Strategies
Adaptive Replacement Cache (ARC) and CLOCK with Adaptive Replacement (CAR) are state-of-the- art "adaptive" cache replacement algorithms invented to improve on the shortcomings of classical cache replacement policies such as LRU, LFU and CLOCK. By separating out items that have been accessed only once and items that have been accessed more frequently ...
Consuegra, Mario E. +5 more
openaire +2 more sources
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
To improve the cache utilization in named data networking, a collaborative cache management strategy, named as ACNCM(ant-colony based neighbor cooperation cache management), was proposed.
Lili Dong +3 more
doaj +2 more sources
Caches are intermediate level between fast CPU and slow main memory. It aims to store copies of frequently used data and to reduce the access time to the main memory.
A. A. Prihozhy
doaj +1 more source
ABSTRACT Low‐tech process‐based stream restoration (LTPBR) is increasingly implemented following wildfire, underscoring the need to evaluate restoration outcomes in burned catchments. To help address this need, we measured abiotic and biotic characteristics of a reach that received LTPBR, an untreated reach, and a reach with relict beaver activity that
Kimberly A. Nichter +5 more
wiley +1 more source
Strategies for Assessing Post‐Wildfire Geomorphic Resilience in Semiarid Rivers
ABSTRACT We review and summarize diverse components of a catchment that can be monitored after wildfire to assess the geomorphic resilience of the river corridor in semiarid regions. We distinguish upland portions of river catchments from river corridors.
Ellen Wohl +8 more
wiley +1 more source
ABSTRACT Low Earth Orbit (LEO) satellite communication systems have evolved into a critical component of global broadband networks, enabling wide‐area connectivity, IoT services, and intelligent multilayer satellite–terrestrial integration. Despite rapid advancements in constellation deployment, routing mechanisms, resource management, and LEO–5G/6G ...
Wei‐Hao Su +2 more
wiley +1 more source

