Pages that link to "Item:Q5218675"

The following pages link to Equation of State Calculations by Fast Computing Machines (Q5218675):

Displaying 50 items.

• Factorization, invariant measure, and random selection of matrices in SU(n) and other groups (Q1075008) (← links)
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach (Q1080365) (← links)
• Parsimonious phylogenetic trees in metric spaces and simulated annealing (Q1099115) (← links)
• On the convergence of stationary distributions in simulated annealing algorithms (Q1099589) (← links)
• Mapping DNA by stochastic relaxation (Q1099802) (← links)
• Efficient parallel simulations of dynamic Ising spin systems (Q1101175) (← links)
• Computer simulation results for the two-point probability function of composite media (Q1101301) (← links)
• Unbiased multi-step estimators for the Monte Carlo evaluation of certain functional integrals (Q1111339) (← links)
• Applications development on the CDC Cyber 205 (Q1115079) (← links)
• Computer techniques for lattice gauge theories (Q1115080) (← links)
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing (Q1117236) (← links)
• An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
• A comparison of stochastic scheduling rules for maximizing project net present value (Q1127130) (← links)
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153) (← links)
• A method of spatial reasoning based on qualitative trigonometry (Q1128486) (← links)
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046) (← links)
• Guidelines for choosing the transition matrix in Monte Carlo methods using Markov chains (Q1148649) (← links)
• Multi-spin coding: A very efficient technique for Monte Carlo simulations of spin systems (Q1149728) (← links)
• Estimation of interaction potentials of spatial point patterns through the maximum likelihood procedure (Q1161234) (← links)
• Comparing sweep strategies for stochastic relaxation (Q1176229) (← links)
• On the Monte Carlo simulation of physical systems (Q1182572) (← links)
• A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
• Canonical ensembles from chaos. II: Constrained dynamical systems (Q1191700) (← links)
• A Markov chain on the symmetric group and Jack symmetric functions (Q1191948) (← links)
• Connectionist learning of belief networks (Q1193492) (← links)
• Use of the Gibbs sampler in expert systems (Q1193494) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Neural networks for control systems - a survey (Q1195800) (← links)
• Composite stock cutting through simulated annealing (Q1197089) (← links)
• Knowledge based approach to the cutting stock problem (Q1197096) (← links)
• Experimental analysis of simulated annealing based algorithms for the layout problem (Q1197688) (← links)
• Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
• Application of statistical mechanics methodology to term-structure bond- pricing models (Q1197724) (← links)
• The afforestation problem: A heuristic method based on simulated annealing (Q1197928) (← links)
• Simulated annealing applied to the process allocation problem (Q1199515) (← links)
• A computational procedure for part design (Q1202713) (← links)
• Genetic algorithms, function optimization, and facility layout design (Q1205709) (← links)
• Genetic algorithms and very fast simulated reannealing: A comparison (Q1206171) (← links)
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
• State space modeling of non-standard actuarial time series (Q1209476) (← links)
• Hastings-Metropolis algorithms and reference measures (Q1265984) (← links)
• Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm (Q1266571) (← links)
• An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
• A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
• What do we know about the Metropolis algorithm? (Q1273859) (← links)
• A feedback algorithm for determining search parameters for Monte Carlo optimization (Q1275169) (← links)
• Linear analysis of genetic algorithms (Q1276251) (← links)
• Scheduling jobs on parallel machines with sequence-dependent setup times (Q1278125) (← links)