نتایج جستجو برای: wilson algorithm

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

Journal: :Library Trends 1996
Joan B. Fiscella

ALTHOUGH PUBLISHED SUBJECT BIBLIOGRAPHIES would seem to have lost their value due to the availability of electronic catalogs and indexes, they still play an important role in winnowing the vast amount of information derived from these resources. This article supports this claim through an examination of an information search of a study of the subjects of play and leisure. The complementary noti...

2006
Alexandros Beskos

Our research began by studying the Perfect Simulation idea developed by Propp and Wilson. In Article 1 we present the “One-Shot CFTP” framework, a general Perfect Simulation algorithm that constructs a Markov chain with a given target density as its equilibrium density and then carries out Perfect Simulation on this chain. The method is based on the Read-Once CFTP idea of Wilson and the Gibbs s...

2006
M. A. Clark

The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extreme...

A new theoretical model based on the local composition concept (TNRF-mNRTL model) was proposed to express the short-range contribution of the excess Gibbs energy for the solutions containing polymer and electrolyte. This contribution of interaction along with the long-range contribution of interaction (Pitzer-Debye-Hückel equation), configurational entropy of mixing (Flory-Huggins relation)...

Journal: :CoRR 2017
Constantinos Daskalakis Andrew Ilyas Vasilis Syrgkanis Haoyang Zeng

We address the issue of limit cycling behavior in training Generative Adversarial Networks and propose the use of Optimistic Mirror Decent (OMD) for training Wasserstein GANs. Recent theoretical results have shown that optimistic mirror decent (OMD) can enjoy faster regret rates in the context of zero-sum games. WGANs is exactly a context of solving a zero-sum game with simultaneous noregret dy...

Journal: :Journal of Visualization and Computer Animation 2004
Kyung Ho Jang Dong Hoon Lee Soon Ki Jung

Modelling from images is a cost-effective means of obtaining virtual cultural heritage models. These models can be effectively constructed from classical Structure from Motion algorithm. However, itïs too difficult to reconstruct whole scenes using SFM method since general oriental historic sites contain a very complex shapes and brilliant colours. To overcome this difficulty, the current paper...

2003
Adil Belhaj

Using mirror pairs (M3,W3) in type II superstring compactifications on Calabi-Yau threefols, we study, geometrically, F-theory duals of M-theory on seven manifolds with G2 holonomy. We first develop a new way for getting Landau Ginzburg (LG) CalabiYau threefols W3, embedded in four complex dimensional toric varieties, mirror to sigma model on toric Calabi-Yau threefolds M3. This method gives di...

1998
Wilhelm Kley Gerhard Schäfer

Treating problems in full general relativity is highly complex and frequently approximate methods are employed to simplify the solution. We present comparative solutions of a infinitesimally thin relativistic, stationary, rigidly rotating disk obtained using the full equations and the approximate approach suggested by Wilson & Mathews. We find that the Wilson-Mathews method has about the same a...

2015
Walid Krichene Alexandre M. Bayen Peter L. Bartlett

We study accelerated mirror descent dynamics in continuous and discrete time. Combining the original continuous-time motivation of mirror descent with a recent ODE interpretation of Nesterov’s accelerated method, we propose a family of continuous-time descent dynamics for convex functions with Lipschitz gradients, such that the solution trajectories converge to the optimum at a O(1/t2) rate. We...

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

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