Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Larrañaga, P.
Graña, M.
D'Anjou, A.
and
Torrealdea, F. J.
1993.
Advances in Artificial Intelligence.
Vol. 728,
Issue. ,
p.
208.
Vecchi, Giuseppe
Pignari, Sergio
and
Canavero, Flavio G.
1993.
Transmission line routing for reduced external field disturbance.
Annales Des Télécommunications,
Vol. 48,
Issue. 5-6,
p.
299.
Rudolph, Günter
1993.
Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms.
Evolutionary Computation,
Vol. 1,
Issue. 4,
p.
361.
Xiaofeng Qi
and
Palmieri, F.
1994.
Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part I: Basic properties of selection and mutation.
IEEE Transactions on Neural Networks,
Vol. 5,
Issue. 1,
p.
102.
Van Lieshout, M. N. M.
1994.
Stochastic annealing for nearest-neighbour point processes with application to object recognition.
Advances in Applied Probability,
Vol. 26,
Issue. 02,
p.
281.
Petritis, Dimitri
1996.
Dynamics of Complex Interacting Systems.
Vol. 2,
Issue. ,
p.
81.
Byoung-Tak Zhang
Paass, G.
and
Muhlenbein, H.
2000.
Convergence properties of incremental Bayesian evolutionary algorithms with single Markov chains.
Vol. 2,
Issue. ,
p.
938.
Andrieu, C.
and
Doucet, A.
2000.
Simulated annealing for maximum a posteriori parameter estimation of hidden Markov models.
IEEE Transactions on Information Theory,
Vol. 46,
Issue. 3,
p.
994.
Agapie, Alexandru
2001.
Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms.
Evolutionary Computation,
Vol. 9,
Issue. 2,
p.
127.
Andrieu, Christophe
Doucet, Arnaud
and
Fitzgerald, William J.
2001.
Nonlinear Dynamics and Statistics.
p.
169.
Andrieu, Christophe
Breyer, Laird A.
and
Doucet, Arnaud
2001.
Convergence of simulated annealing using Foster-Lyapunov criteria.
Journal of Applied Probability,
Vol. 38,
Issue. 4,
p.
975.
Locatelli, Marco
2002.
Handbook of Global Optimization.
Vol. 62,
Issue. ,
p.
179.
Devroye, Luc
and
Krzyzak, Adam
2002.
Modeling Uncertainty.
Vol. 46,
Issue. ,
p.
383.
Iovleff, Serge
and
Perrin, Olivier
2004.
Estimating a Nonstationary Spatial Structure Using Simulated Annealing.
Journal of Computational and Graphical Statistics,
Vol. 13,
Issue. 1,
p.
90.
Perrin, Guillaume
Descombes, Xavier
and
Zerubia, Josiane
2005.
Energy Minimization Methods in Computer Vision and Pattern Recognition.
Vol. 3757,
Issue. ,
p.
3.
Agapie, Alexandru
and
Agapie, Mircea
2007.
Transition Functions for Evolutionary Algorithms on Continuous State-space.
Journal of Mathematical Modelling and Algorithms,
Vol. 6,
Issue. 2,
p.
297.
Kluszczyński, R.
van Lieshout, M. N. M.
and
Schreiber, T.
2007.
Image segmentation by polygonal Markov Fields.
Annals of the Institute of Statistical Mathematics,
Vol. 59,
Issue. 3,
p.
465.
Lecchini-Visintini, A.
Lygeros, J.
and
Maciejowski, J.
2008.
On the approximate domain optimization of deterministic and expected value criteria.
p.
4933.
Stoica, R.S.
2010.
Marked point processes for statistical and morphological analysis of astronomical data.
The European Physical Journal Special Topics,
Vol. 186,
Issue. 1,
p.
123.
SCHREIBER, TOMASZ
and
VAN LIESHOUT, MARIE-COLETTE
2010.
Disagreement Loop and Path Creation/Annihilation Algorithms for Binary Planar Markov Fields with Applications to Image Segmentation.
Scandinavian Journal of Statistics,
Vol. 37,
Issue. 2,
p.
264.