Add to ORKGSIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
We provide a set of conditions which ensure the almost sure convergence of a class of simulated anne...
In this paper we propose a modified version of the simulated annealing algorithm for solving a stoch...
In this paper, inspired by the idea of Metropolis algorithm, a new sample adaptive simulated anneali...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Generalizing the results of Faigle and Schrader [Inform. Process. Lett., 27 (1988), pp. 189–194] a s...
Generalizing the results of Faigle and Schrader [Inform. Process. Lett., 27 (1988), pp. 189–194] a s...
Generalizing the results of the first author and Rainer Schrader [Inf. Process. Lett. 27, 189-194 (1...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22522, issue : a.1996 n....
International audienceWe study convergence rates of R-d-valued algorithms, especially in the case of...
Rigorous proofs of the convergence of the simulated annealing process in the original formulation ha...
It is well-known that the standard simulated annealing optimization method converges in distribution...
Simulated annealing is a probabilistic optimization algorithm which is used for approximating the gl...
Abstract: We prove the convergence of the simulated anealing algorithm by estimating the second eige...
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimizati...
In this paper we propose a modified version of the simulated annealing algorithm for solving a stoch...
We provide a set of conditions which ensure the almost sure convergence of a class of simulated anne...
In this paper we propose a modified version of the simulated annealing algorithm for solving a stoch...
In this paper, inspired by the idea of Metropolis algorithm, a new sample adaptive simulated anneali...
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
Generalizing the results of Faigle and Schrader [Inform. Process. Lett., 27 (1988), pp. 189–194] a s...
Generalizing the results of Faigle and Schrader [Inform. Process. Lett., 27 (1988), pp. 189–194] a s...
Generalizing the results of the first author and Rainer Schrader [Inf. Process. Lett. 27, 189-194 (1...
SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22522, issue : a.1996 n....
International audienceWe study convergence rates of R-d-valued algorithms, especially in the case of...
Rigorous proofs of the convergence of the simulated annealing process in the original formulation ha...
It is well-known that the standard simulated annealing optimization method converges in distribution...
Simulated annealing is a probabilistic optimization algorithm which is used for approximating the gl...
Abstract: We prove the convergence of the simulated anealing algorithm by estimating the second eige...
Simulated Annealing is a family of randomized algorithms used to solve many combinatorial optimizati...
In this paper we propose a modified version of the simulated annealing algorithm for solving a stoch...
We provide a set of conditions which ensure the almost sure convergence of a class of simulated anne...
In this paper we propose a modified version of the simulated annealing algorithm for solving a stoch...
In this paper, inspired by the idea of Metropolis algorithm, a new sample adaptive simulated anneali...