Search Results - subject:"Algorithms."

Convergency of the Monte Carlo algorithms for linear transport modeling1This work was supported by the Ministry of Science, Education and Technology of Bulgaria under grants # I501...

Nedjalkov, M.; Dimov, I. - In: Mathematics and Computers in Simulation (MATCOM) 47 (1998) 2, pp. 383-390

We consider the convergency of the basic Monte Carlo (MC) algorithms for solving the Boltzmann transport equation (BTE … transport, radiative transfer, medium energy electron and ion scattering in solids, etc. The variety of the MC algorithms can be … summarized in three main groups. The algorithms of the first one simulate the natural chain of events, happening during the …

Persistent link: https://www.econbiz.de/10010748844

Excited states by quantum Monte Carlo method

Blume, D.; Lewerenz, M.; Whaley, K.B. - In: Mathematics and Computers in Simulation (MATCOM) 47 (1998) 2, pp. 133-141

We present applications of a new Monte Carlo algorithm for the calculation of excited state energies of multi-dimensional quantum systems. The method relies on computation of imaginary time correlation functions of appropriately chosen projection operators, followed by a numerical inverse...

Persistent link: https://www.econbiz.de/10010748907

Symbolic manipulation techniques for model simplification in object-oriented modelling of large scale continuous systems

Carpanzano, Emanuele; Maffezzoni, Claudio - In: Mathematics and Computers in Simulation (MATCOM) 48 (1998) 2, pp. 133-150

discussed algorithms and criteria on serial multibody systems are illustrated. A brief overview on further known symbolic …

Persistent link: https://www.econbiz.de/10010749442

A concept paper on dynamic reliability via Monte Carlo simulation

Marseguerra, M.; Zio, E.; Devooght, J.; Labeau, P.E. - In: Mathematics and Computers in Simulation (MATCOM) 47 (1998) 2, pp. 371-382

capable, in principle, of handling all the features of dynamic PSA is illustrated. Monte Carlo algorithms are illustrated …

Persistent link: https://www.econbiz.de/10010750146

Can evolutionary algorithms describe learning processes?

Brenner, Thomas - In: Journal of Evolutionary Economics 8 (1998) 3, pp. 271-283

Evolutionary algorithms have attracted more and more the attention of economists in recent years. Repeatedly it is …. Subsequently, this model is compared with a formulation of evolutionary algorithms. The comparison reveals that although both …

Persistent link: https://www.econbiz.de/10005622525

Identification of Highly Informative Molecular Profile Components using Genetic Algorithms

Stefanini, Federico Mattia - Santa Fe Institute - 1998

profile components within the large set of observable bands produced in pilot experiments. Thus, Genetic Algorithms may be …

Persistent link: https://www.econbiz.de/10005739970

Communication and Cooperation

Miller, John H.; Butts, Carter; Rode, David - Santa Fe Institute - 1998

Communication plays a vital role in the organization and operation of biological, computational, economic, and social systems. Agents often base their behavior on the signals they receive from others and also recognize the importance of the signals they send. Here we develop a framework for...

Persistent link: https://www.econbiz.de/10005790666

Macroevolutionary Algorithms: A New Optimization Method on Fitness Landscapes

Marin, Jesus; Sole, Ricard V. - Santa Fe Institute - 1998

patterns in macroevolution. We name them Macroevolutionary Algorithms (MA). Unlike population-level evolution, which is … employed in standard genetic algorithms, evolution at the level of higher taxa is used as the underlying metaphor. The model … test its effectiveness, we compare the performance of MAs versus genetic algorithms (GA) with tournament selection. The …

Persistent link: https://www.econbiz.de/10005791039

Stochastic adaptive selection of weights in the simulated tempering algorithm

Ramponi, Alessandro - In: Statistical Methods and Applications 7 (1998) 1, pp. 27-55

Persistent link: https://www.econbiz.de/10008497255

Hastings-Metropolis algorithms and reference measures

Chen, Pei-de - In: Statistics & Probability Letters 38 (1998) 4, pp. 323-328

In this note, we discuss the possible existence and effect of different reference measures on the Hastings-Metropolis (H-M) algorithm. We prove that the standard H-M algorithm as a Markov chain does not depend on the choice of the reference measure, and we obtain a sufficient and necessary...

Persistent link: https://www.econbiz.de/10005138146