نتایج جستجو برای: wilson algorithm
تعداد نتایج: 770670 فیلتر نتایج به سال:
We look at energies of the low lying states of the hadronic string in three dimensional SU(2) lattice gauge theory by forming correlation matrices among different sources. We are able to go to previously inaccessible time separations. This is made possible by using a new algorithm proposed by Lüscher and Weisz which lets us measure the exponentially small values of large Wilson loops with suffi...
Introduction: The Wilson disease is an autosomal recessive disease in which the liver, central nervous system, eyes, blood and other parts of the body involved. Timely diagnosis and appropriate treatment of the disease requires awareness of the clinical presentations of this disease in children.Methods: This case series study included 62 patients with Wilson disease who admitted to children's M...
Meeting optical beam jitter requirements is becoming a challenging problem for several space programs. A laser beam jitter control test bed has been developed at the Naval Postgraduate School to develop improved jitter control techniques. Several control techniques, such as least means squares and linear–quadratic regulator were applied for jitter control. Enhancement in least means squares tec...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.
The combination of a non-overlapping Schwarz preconditioner and the Hybrid Monte Carlo (HMC) algorithm is shown to yield an efficient simulation algorithm for two-flavour lattice QCD with Wilson quarks. Extensive tests are performed, on lattices of size up to 32×24, with lattice spacings a ≃ 0.08 fm and at bare current-quark masses as low as 21MeV.
The combination of a non-overlapping Schwarz preconditioner and the Hybrid Monte Carlo (HMC) algorithm is shown to yield an efficient simulation algorithm for two-flavour lattice QCD with Wilson quarks. Extensive tests are performed, on lattices of size up to 32×24, with lattice spacings a ≃ 0.08 fm and at bare current-quark masses as low as 21MeV.
We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید