Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Simulated_annealing> ?p ?o. }

• Simulated_annealing abstract "Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more efficient than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.The name and inspiration come from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects. Both are attributes of the material that depend on its thermodynamic free energy. Heating and cooling the material affects both the temperature and the thermodynamic free energy. While the same amount of cooling brings the same amount of decrease in temperature it will bring a bigger or smaller decrease in the thermodynamic free energy depending on the rate that it occurs, with a slower rate producing a bigger decrease.This notion of slow cooling is implemented in the Simulated Annealing algorithm as a slow decrease in the probability of accepting worse solutions as it explores the solution space. Accepting worse solutions is a fundamental property of metaheuristics because it allows for a more extensive search for the optimal solution.The method was independently described by Scott Kirkpatrick, C. Daniel Gelatt and Mario P. Vecchi in 1983, and by Vlado Černý in 1985. The method is an adaptation of the Metropolis-Hastings algorithm, a Monte Carlo method to generate sample states of a thermodynamic system, invented by M.N. Rosenbluth and published in a paper by N. Metropolis et al. in 1953.".
• Simulated_annealing thumbnail Hill_Climbing_with_Simulated_Annealing.gif?width=300.
• Simulated_annealing wikiPageExternalLink SimulatedAnnealing.
• Simulated_annealing wikiPageExternalLink pg=549.
• Simulated_annealing wikiPageExternalLink uncertainty-hovers-over-claim-googles-using-quantum-computer.ars.
• Simulated_annealing wikiPageExternalLink downloads.html.
• Simulated_annealing wikiPageExternalLink GenSA.
• Simulated_annealing wikiPageExternalLink Simulated_Annealing_Project.
• Simulated_annealing wikiPageExternalLink optim.html.
• Simulated_annealing wikiPageExternalLink page1.html.
• Simulated_annealing wikiPageExternalLink loadFile.do?objectId=10548&objectType=file.
• Simulated_annealing wikiPageExternalLink simann.f.
• Simulated_annealing wikiPageExternalLink index.php?item=9.
• Simulated_annealing wikiPageID "172244".
• Simulated_annealing wikiPageRevisionID "604285962".
• Simulated_annealing hasPhotoCollection Simulated_annealing.
• Simulated_annealing subject Category:Heuristic_algorithms.
• Simulated_annealing subject Category:Monte_Carlo_methods.
• Simulated_annealing subject Category:Optimization_algorithms_and_methods.
• Simulated_annealing type Ability105616246.
• Simulated_annealing type Abstraction100002137.
• Simulated_annealing type Act100030358.
• Simulated_annealing type Activity100407535.
• Simulated_annealing type Algorithm105847438.
• Simulated_annealing type Cognition100023271.
• Simulated_annealing type Event100029378.
• Simulated_annealing type HeuristicAlgorithms.
• Simulated_annealing type Know-how105616786.
• Simulated_annealing type Method105660268.
• Simulated_annealing type MonteCarloMethods.
• Simulated_annealing type OptimizationAlgorithmsAndMethods.
• Simulated_annealing type Procedure101023820.
• Simulated_annealing type PsychologicalFeature100023100.
• Simulated_annealing type Rule105846932.
• Simulated_annealing type YagoPermanentlyLocatedEntity.
• Simulated_annealing comment "Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities).".
• Simulated_annealing label "Algoritmo de recocido simulado".
• Simulated_annealing label "Recuit simulé".
• Simulated_annealing label "Simulated annealing".
• Simulated_annealing label "Simulated annealing".
• Simulated_annealing label "Simulated annealing".
• Simulated_annealing label "Simulated annealing".
• Simulated_annealing label "Simulated annealing".
• Simulated_annealing label "Symulowane wyżarzanie".
• Simulated_annealing label "Алгоритм имитации отжига".
• Simulated_annealing label "تخمير محاكى".
• Simulated_annealing label "模拟退火".
• Simulated_annealing label "焼きなまし法".
• Simulated_annealing sameAs Simulované_žíhání.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing sameAs Algoritmo_de_recocido_simulado.
• Simulated_annealing sameAs Recuit_simulé.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing sameAs 焼きなまし法.
• Simulated_annealing sameAs 담금질_기법.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing sameAs Symulowane_wyżarzanie.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing sameAs m.01758y.
• Simulated_annealing sameAs Q863783.
• Simulated_annealing sameAs Q863783.
• Simulated_annealing sameAs Simulated_annealing.
• Simulated_annealing wasDerivedFrom Simulated_annealing?oldid=604285962.
• Simulated_annealing depiction Hill_Climbing_with_Simulated_Annealing.gif.
• Simulated_annealing isPrimaryTopicOf Simulated_annealing.