Results 141 to 150 of about 47,947 (303)

Business cycles: real facts and a monetary myth

open access: yes
This paper argues that the reporting of facts in light of theory fosters the development of theory. Dynamic neoclassical macro theory guided the selection of facts to report. The hope is that these facts will foster the further development of this theory.
Finn E. Kydland, Edward C. Prescott
core  

Approximately counting Hamilton paths and cycles in dense graphs

open access: yes, 2018
: "We describe fully polynomial randomized approximation schemes for the problems of determining the number of Hamilton paths and cycles in an n-vertex graph with minimum degree (1/2 + [epsilon])n, for any fixed [epsilon] > 0.
Jerrum (5364959)   +2 more
core   +1 more source

Electrode and Microstructure Dependence of Oxygen Diffusion in Ferroelectric Hafnium Zirconium Oxide Thin Films

open access: yesAdvanced Functional Materials, EarlyView.
Significant nanoscale oxygen diffusion coefficient variations are measured in ferroelectric hafnium zirconium oxide films with grain boundaries and electrode interfaces exhibiting values 104 times larger than the grain cores. Overall coefficients are 10X larger for films prepared with metal nitride electrodes compared to refractory metals. New insights
Liron Shvilberg   +6 more
wiley   +1 more source

Intersections of Longest Paths and Cycles

open access: yes, 2008
It is a well known fact in graph theory that in a connected graph any two longest paths must have a vertex in common. In this paper we will explore what happens when we look at k - connected graphs, leading us to make a conjecture about the intersection ...
Hippchen, Thomas
core  

Existence of dominating cycles and paths

open access: yesDiscrete Mathematics, 1983
AbstractA cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at least one vertex of C. A D-path is defined analogously. If a graph G contains a D-cycle (D-path), then its edge graph L(G) has a hamiltonian cycle (hamiltonian path). Necessary conditions and sufficient conditions are obtained for graphs to have a
openaire   +2 more sources

Integrated Field‐Free SOT Domain‐Wall Synapses and MTJ Stochastic Neurons for Hardware Boltzmann Machines

open access: yesAdvanced Functional Materials, EarlyView.
Field‐free spin‐orbit torque domain‐wall synapses integrated with stochastic MTJ neurons enable compact hardware Boltzmann machines. Leveraging intrinsic stochasticity and multi‐level conductance, the system achieves efficient probabilistic learning with high accuracy, demonstrating a scalable spintronic platform for energy‐efficient edge AI.
Aijaz H. Lone   +8 more
wiley   +1 more source

Stabilizing Competitive Cycles with Distortionary Taxation [PDF]

open access: yes
We utilize a simple overlapping generations model with a balanced budget rule to study the effect of distortionary taxation on cycles and local stability of equilibria.
Mikko Puhakka, Erkki Koskela
core  

Historical Foundation and Practical Guideline for Ferroelectric Switching Kinetic Studies

open access: yesAdvanced Functional Materials, EarlyView.
The P and U pulses in the conventional PUND measurements are not identical because of the interplay between switching current and the measurement circuit components. This circuit effect can lead to a shift in polarization transients and misinterpreted physics in the switching kinetics.
Yi Liang, Pat Kezer, John T. Heron
wiley   +1 more source

The Cost of Business Cycles Under Endogenous Growth [PDF]

open access: yes
In his famous monograph, Lucas (1987) put forth an argument that the welfare gains from reducing the volatility of aggregate consumption are negligible. Subsequent work that revisited Lucas' calculation continued to find only small benefits from reducing
Gadi Barlevy
core  

On the distinguishing chromatic number of the Kronecker products of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
In this paper, we investigate the distinguishing chromatic number of Kronecker product of paths, cycles, star graphs, symmetric trees, almost symmetric trees, and bisymmetric trees.
Zinat Rastgar   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy