نتایج جستجو برای: annealing time

تعداد نتایج: 1913073  

Journal: :Journal of Statistical Physics 2023

Finding a ground state of given Hamiltonian an Ising model on graph $$G=(V,E)$$ is important but hard problem. The standard approach for this kind problem the application algorithms that rely single-spin-flip Markov chain Monte Carlo methods, such as simulated annealing based Glauber or Metropolis dynamics. In paper, we investigate particular stochastic cellular automata, in which all spins are...

زرگرشوشتری, مرتضی, موسوی‌قهفرخی, سیدابراهیم,

In this paper, Bi1.64-xPb0.36CdxSr2Ca2Cu3Oy (BPCSCCO) superconductor with x = 0.0, 0.02, 0.04 and 0.06 is made by the solid state reaction method. The magnetic susceptibility measurements were performed using AC susceptometer. The microstructure and morphology of the samples have been studied by X-ray diffraction, scanning electron microscope and energy dispersive X-ray. The results show that t...

Duplex stainless steels (DSSS) have a microstructure composed of ferrite and austenite phases that gives them a very good combination of mechanical and corrosion properties. These steels are desirable for many applications in the chemical and petrochemical industries. In the present study, a type of stainless steel was cast, solution annealed at 1200°C for 60 min and then quenched in water. Ini...

2004
Ivona Bezáková Daniel Štefankovič Vijay V. Vazirani Eric Vigoda

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda. They designed a simulated annealing algorithm with a running time of O∗(n26) for 0/1 matrices. Subsequently, they improved their analysis, resulting in a O∗(n10) time algorithm. We present a O∗(n7) time algorithm. Our improvement come...

1996
Andreas Nolte Rainer Schrader

Simulated Annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of Simulated Annealing to the 3-coloring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected rst hitting time of a proper coloring, given an arbitrary cooling scheme, is of exponential size....

2014
THUAN DUONG-BA THINH NGUYEN BELLA BOSE Thuan Duong-Ba Thinh Nguyen Bella Bose

Simulated annealing (SA) algorithms can be modeled as time-inhomogeneous Markov chains. Much work on the convergence rate of simulated annealing algorithms has been well-studied. In this paper, we propose an adiabatic framework for studying simulated annealing algorithm behavior. Specifically, we focus on the problem of simulated annealing algorithms that start from an initial temperature T0 an...

Hamid Azizi-Alizamini Matthias Militzer Vishnu Charan Sangem

This paper provides an overview on obtaining low-carbon ultra-fine grained dual-phase steels through rapid intercritical annealing of cold-rolled sheet as improved materials for automotive applications. A laboratory processing route was designed that involves cold-rolling of a tempered martensite structure followed by a second tempering step to produce a fine grained aggregate of ferrite and ca...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید