Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Great_Deluge_algorithm> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Great_Deluge_algorithm abstract "The Great Deluge algorithm (GD) is a generic algorithm applied to optimization problems. It is similar in many ways to the hill-climbing and simulated annealing algorithms.The name comes from the analogy that in a great deluge a person climbing a hill will try to move in any direction that does not get his/her feet wet in the hope of finding a way up as the water level rises.In a typical implementation of the GD, the algorithm starts with a poor approximation, S, of the optimum solution. A numerical value called the badness is computed based on S and it measures how undesirable the initial approximation is. The higher the value of badness the more undesirable is the approximate solution. Another numerical value called the tolerance is calculated based on a number of factors, often including the initial badness.A new approximate solution S' , called a neighbour of S, is calculated based on S. The badness of S' , b' , is computed and compared with the tolerance. If b' is better than tolerance, then the algorithm is recursively restarted with S : = S' , and tolerance := decay(tolerance) where decay is a function that lowers the tolerance (representing a rise in water levels). If b' is worse than tolerance, a different neighbour S* of S is chosen and the process repeated. If all the neighbours of S produce approximate solutions beyond tolerance, then the algorithm is terminated and S is put forward as the best approximate solution obtained.".
- Great_Deluge_algorithm wikiPageID "7344581".
- Great_Deluge_algorithm wikiPageLength "2109".
- Great_Deluge_algorithm wikiPageOutDegree "4".
- Great_Deluge_algorithm wikiPageRevisionID "544561284".
- Great_Deluge_algorithm wikiPageWikiLink Category:Optimization_algorithms_and_methods.
- Great_Deluge_algorithm wikiPageWikiLink Hill-climbing.
- Great_Deluge_algorithm wikiPageWikiLink Hill_climbing.
- Great_Deluge_algorithm wikiPageWikiLink Mathematical_optimization.
- Great_Deluge_algorithm wikiPageWikiLink Optimization_(mathematics).
- Great_Deluge_algorithm wikiPageWikiLink Simulated_annealing.
- Great_Deluge_algorithm wikiPageWikiLinkText "Great Deluge algorithm".
- Great_Deluge_algorithm hasPhotoCollection Great_Deluge_algorithm.
- Great_Deluge_algorithm wikiPageUsesTemplate Template:Optimization_algorithms.
- Great_Deluge_algorithm subject Category:Optimization_algorithms_and_methods.
- Great_Deluge_algorithm hypernym Algorithm.
- Great_Deluge_algorithm type Software.
- Great_Deluge_algorithm type Algorithm.
- Great_Deluge_algorithm comment "The Great Deluge algorithm (GD) is a generic algorithm applied to optimization problems. It is similar in many ways to the hill-climbing and simulated annealing algorithms.The name comes from the analogy that in a great deluge a person climbing a hill will try to move in any direction that does not get his/her feet wet in the hope of finding a way up as the water level rises.In a typical implementation of the GD, the algorithm starts with a poor approximation, S, of the optimum solution.".
- Great_Deluge_algorithm label "Great Deluge algorithm".
- Great_Deluge_algorithm sameAs Sintflutalgorithmus.
- Great_Deluge_algorithm sameAs m.025zrpn.
- Great_Deluge_algorithm sameAs Q2289656.
- Great_Deluge_algorithm sameAs Q2289656.
- Great_Deluge_algorithm wasDerivedFrom Great_Deluge_algorithm?oldid=544561284.
- Great_Deluge_algorithm isPrimaryTopicOf Great_Deluge_algorithm.