SIGN IN
SIGN UP
Necessary and sufficient conditions for success of the metropolis algorithm for optimization
Full Text:
PDF
Buy this Article
Authors:
Swagato Sanyal
Indian Institute of Technology, Kanpur, India
Raja S
Indian Institute of Technology, Kanpur, India
Somenath Biswas
Indian Institute of Technology, Kanpur, India
Published in:
· Proceeding
GECCO '10
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Pages 1417-1424
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-4503-0072-8
doi>
10.1145/1830483.1830744
2010 Article
Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 23
· Downloads (cumulative): 91
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '13
Share:
|
Tags:
algorithms
metropolis algorithm
optimization
probabilistic algorithms
rapid mixing of markov chains
simulated annealing
success of markov chain families
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder