Results 11 - 20 of 5,361

Drawing Graphs Nicely Using Simulated Annealing

by Ron Davidson, David Harel , 1996
"... The paradigm of simulated annealing is applied to the problem of drawing graphs "nicely." Our algorithm deals with general graphs with straigh-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights of ..."
Abstract - Cited by 219 (11 self) - Add to MetaCart
The paradigm of simulated annealing is applied to the problem of drawing graphs "nicely." Our algorithm deals with general graphs with straigh-line edges, and employs several simple criteria for the aesthetic quality of the result. The algorithm is flexible, in that the relative weights

Cycle Decompositions and Simulated Annealing

by Alain Trouve , 1994
"... The behavior of simulated annealing algorithms is tightly related to the hierarchical decomposition of their configuration spaces in cycles. In the generalized annealing framework, this decomposition which is defined recursively. In this paper, its structure is extensively studied and it is shown th ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
The behavior of simulated annealing algorithms is tightly related to the hierarchical decomposition of their configuration spaces in cycles. In the generalized annealing framework, this decomposition which is defined recursively. In this paper, its structure is extensively studied and it is shown

What is Simulated Annealing?

by Michael W. Trosset , 2000
"... Beginning in 1983, simulated annealing was marketed as a global optimization methodology that mimics the physical annealing process by which molten substances cool to crystalline lattices of minimal energy. This marketing strategy had a polarizing effect, attracting those who delighted in metapho ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Beginning in 1983, simulated annealing was marketed as a global optimization methodology that mimics the physical annealing process by which molten substances cool to crystalline lattices of minimal energy. This marketing strategy had a polarizing effect, attracting those who delighted

Simulated annealing for graph bisection

by Mark Jerrum - in Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science , 1993
"... We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, find the optimal bisection of a random graph in Gnpr when p- r = O(n*-’) for A 5 2. (The random graph model Gnpr specifies a “planted ” bisection of density r, ..."
Abstract - Cited by 40 (1 self) - Add to MetaCart
We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, find the optimal bisection of a random graph in Gnpr when p- r = O(n*-’) for A 5 2. (The random graph model Gnpr specifies a “planted ” bisection of density r

On chaotic simulated annealing

by Lipo Wang, Kate Smith - IEEE Trans. Neural Net , 1998
"... Abstract — Chen and Aihara recently proposed a chaotic simulated annealing approach to solving optimization problems. By adding a negative self-coupling to a network model proposed earlier by Aihara et al. and gradually removing this negative self-coupling, they used the transient chaos for searchin ..."
Abstract - Cited by 11 (4 self) - Add to MetaCart
Abstract — Chen and Aihara recently proposed a chaotic simulated annealing approach to solving optimization problems. By adding a negative self-coupling to a network model proposed earlier by Aihara et al. and gradually removing this negative self-coupling, they used the transient chaos

Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and Bayesian scoring functions

by Kim T. Simons, Charles Kooperberg, Enoch Huang, David Baker - J. MOL. BIOL , 1997
"... We explore the ability of a simple simulated annealing procedure to assemble native-like structures from fragments of unrelated protein structures with similar local sequences using Bayesian scoring functions. Environment and residue pair specific contributions to the scoring functions appear as the ..."
Abstract - Cited by 393 (70 self) - Add to MetaCart
We explore the ability of a simple simulated annealing procedure to assemble native-like structures from fragments of unrelated protein structures with similar local sequences using Bayesian scoring functions. Environment and residue pair specific contributions to the scoring functions appear

Simulated annealing for topological solitons

by Mark Hale, Oliver Schwindt, Tom Weidig - Phys. Rev. E , 2000
"... The search for solutions of field theories allowing for topological solitons requires that we find the field configuration with the lowest energy in a given sector of topological charge. The standard approach is based on the numerical solution of the static Euler-Lagrange differential equation follo ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
following from the field energy. As an alternative, we propose to use a simulated annealing algorithm to minimize the energy functional directly. We have applied simulated annealing to several nonlinear classical field theories: the sine Gordon model in one dimension, the baby Skyrme model in two dimensions

Piecewise deterministic simulated annealing

by unknown authors , 2014
"... Given an energy potential on the Euclidian space, a piecewise deterministic Markov process is designed to sample the corresponding Gibbs measure. In dimension one an Eyring–Kramers formula is obtained for the exit time of the domain of a local minimum at low temperature, and a necessary and sufficie ..."
Abstract - Add to MetaCart
and sufficient condition is given on the cooling sched-ule in a simulated annealing algorithm to ensure the process converges to the set of global minima. This condition is similar to the classical one for diffusions and involves the critical depth of the potential. 1 Introduction and main results 1.1 Simulated

Simulated Annealing with Estimated Temperature

by Eric Poupaert, Yves Deville - AI Communication , 2000
"... this paper, we propose, describe and evaluate a new simulated annealing algorithm based on the idea of maintaining an evolving target acceptance probability during optimization. In this algorithm, acceptance probability is elected as a new control parameter: the temperature of each Metropolis chain ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
this paper, we propose, describe and evaluate a new simulated annealing algorithm based on the idea of maintaining an evolving target acceptance probability during optimization. In this algorithm, acceptance probability is elected as a new control parameter: the temperature of each Metropolis chain

Lexical disambiguation using simulated annealing

by Jim Cowie, Joe Guthrie, Louise Guthrie - in COLING , 1992
"... The resolution of lexical ambiguity is important for most natural language processing tasks, and a range of computational techniques have been proposed for its solution. None of these has yet proven effective on a large scale. In this paper, we describe a method for lexical disambiguation of text us ..."
Abstract - Cited by 124 (2 self) - Add to MetaCart
using the definitions in a machine-readable dictionm~j together with the technique of simulated annealing. The method operates on complete sentences and attempts to select the optimal combinations of word senses for all the words in the sentence simultaneously. The words in the sentences may be any
Results 11 - 20 of 5,361