Talk:Heuristic algorithm - Revision history

Jlwoodwa: tpr

2024-05-04T00:16:34Z

tpr

← Previous revision		Revision as of 00:16, 4 May 2024
Line 1:		Line 1:
			{{tpr}}

	==Virusscanners==		==Virusscanners==

Optimering: /* Redirected */ new section

2010-05-16T13:43:09Z

Redirected: new section

← Previous revision		Revision as of 13:43, 16 May 2010
Line 68:		Line 68:

	positive ,in order to prevent negative loops or reaching a state beyond the goal(were goal should always be zero). <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/132.72.44.49\|132.72.44.49]] ([[User talk:132.72.44.49\|talk]]) 18:34, 26 January 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->		positive ,in order to prevent negative loops or reaching a state beyond the goal(were goal should always be zero). <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/132.72.44.49\|132.72.44.49]] ([[User talk:132.72.44.49\|talk]]) 18:34, 26 January 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

			== Redirected ==

			Dear All,

			This page has been redirected to [[metaheuristic]] which is commonly used in the literature to mean heuristic optimizer, black-box optimizer, etc. The term ''heuristic algorithm'' is in fact self-contradictory if you see the dictionary definition: ''Heuristic: Computers, Mathematics. pertaining to a trial-and-error method of problem solving used when an algorithmic approach is impractical.''

			Furthermore the page here was very sketchy and the [[metaheuristic]] page has just been updated.

			I hope you all agree with this change.

			[[User:Optimering\|Optimering]] ([[User talk:Optimering\|talk]]) 13:43, 16 May 2010 (UTC)

SineBot: Signing comment by 132.72.44.49 - ""

2010-01-26T18:36:15Z

Signing comment by 132.72.44.49 - ""

← Previous revision		Revision as of 18:36, 26 January 2010
Line 67:		Line 67:
	monotonic, for any node its heuristic cost is higher then its father heuristic value		monotonic, for any node its heuristic cost is higher then its father heuristic value

	positive ,in order to prevent negative loops or reaching a state beyond the goal(were goal should always be zero).		positive ,in order to prevent negative loops or reaching a state beyond the goal(were goal should always be zero). <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/132.72.44.49\|132.72.44.49]] ([[User talk:132.72.44.49\|talk]]) 18:34, 26 January 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

132.72.44.49 at 18:34, 26 January 2010

2010-01-26T18:34:52Z

← Previous revision		Revision as of 18:34, 26 January 2010
Line 55:		Line 55:

	:Heuristic algorithm is not the same as new algorithm, which proof is not found yet. Sometime some opponent uses the word "heuristic" to note poor mathematical basis for some algorithm, but it is not true usage of this word. Also, some areas of programming can develop algorithm without expenses for its strong proof - for example, game programming area. To optimize development expenses the developers may "ignore whether the solution to a problem can be proven to be correct".--[[User:Tim32\|Tim32]] ([[User talk:Tim32\|talk]]) 22:46, 19 January 2009 (UTC)		:Heuristic algorithm is not the same as new algorithm, which proof is not found yet. Sometime some opponent uses the word "heuristic" to note poor mathematical basis for some algorithm, but it is not true usage of this word. Also, some areas of programming can develop algorithm without expenses for its strong proof - for example, game programming area. To optimize development expenses the developers may "ignore whether the solution to a problem can be proven to be correct".--[[User:Tim32\|Tim32]] ([[User talk:Tim32\|talk]]) 22:46, 19 January 2009 (UTC)


			== propertys of huristics ==

			easy to compute: polinomialic in compute time.

			admisable, lower bound to the optimal solution. for n is node from N(group of all nodes) and o is optimum value, h is huristic function : N->number so for all n goes h(n)<=o(n)

			consistent, for the huristic value from node n is to describe the shortest path to the goal. meaning that for n to the goal is shorter then optimal from n to node m, plus the huristic value of m to the goal. such as: h(n)<=opt(n,m)+h(m)

			monotonic, for any node its heuristic cost is higher then its father heuristic value

			positive ,in order to prevent negative loops or reaching a state beyond the goal(were goal should always be zero).

SineBot: Signing comment by 212.44.6.81 - "/* Reference */"

2009-01-29T11:33:56Z

Signing comment by 212.44.6.81 - "Reference: "

← Previous revision		Revision as of 11:33, 29 January 2009
Line 47:		Line 47:
	not of "intelligent search strategies".		not of "intelligent search strategies".
	If anything, "intelligent search strategies" are the result of heuristics.		If anything, "intelligent search strategies" are the result of heuristics.
	If "heuristic methods" are different to heuristics, that should be clarified.		If "heuristic methods" are different to heuristics, that should be clarified. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/212.44.6.81\|212.44.6.81]] ([[User talk:212.44.6.81\|talk]]) 11:32, 29 January 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->

	== Heuristic = Rules of Thumb ? ==		== Heuristic = Rules of Thumb ? ==

212.44.6.81: /* Reference */

2009-01-29T11:32:42Z

Reference

← Previous revision		Revision as of 11:32, 29 January 2009
Line 42:		Line 42:
	What's the reference to "Pearl (1984)"?		What's the reference to "Pearl (1984)"?
	[[User:Houseofwealth\|Houseofwealth]] ([[User talk:Houseofwealth\|talk]]) 23:16, 19 December 2007 (UTC)		[[User:Houseofwealth\|Houseofwealth]] ([[User talk:Houseofwealth\|talk]]) 23:16, 19 December 2007 (UTC)

			The Pearl reference seems likely to be taken out of context, and its meaning isn't clear.
			Most heuristics are just things that work in practice, often the result of a human's hunch,
			not of "intelligent search strategies".
			If anything, "intelligent search strategies" are the result of heuristics.
			If "heuristic methods" are different to heuristics, that should be clarified.

	== Heuristic = Rules of Thumb ? ==		== Heuristic = Rules of Thumb ? ==

Tim32: /* Heuristic = Rules of Thumb ? */

2009-01-19T22:46:23Z

Heuristic = Rules of Thumb ?

← Previous revision		Revision as of 22:46, 19 January 2009
Line 47:		Line 47:

	Along those same lines, is the lead paragraph even correct? Is a heuristic algorithm really "an algorithm that ignores whether the solution to a problem can be proven to be correct"? I thought it was an algorithm that couldn't be proven to give the best answer. (I'm out of my field, here.)--[[User:Popnose\|Christopher King]] ([[User talk:Popnose\|talk]]) 14:37, 8 January 2009 (UTC)		Along those same lines, is the lead paragraph even correct? Is a heuristic algorithm really "an algorithm that ignores whether the solution to a problem can be proven to be correct"? I thought it was an algorithm that couldn't be proven to give the best answer. (I'm out of my field, here.)--[[User:Popnose\|Christopher King]] ([[User talk:Popnose\|talk]]) 14:37, 8 January 2009 (UTC)

			:Heuristic algorithm is not the same as new algorithm, which proof is not found yet. Sometime some opponent uses the word "heuristic" to note poor mathematical basis for some algorithm, but it is not true usage of this word. Also, some areas of programming can develop algorithm without expenses for its strong proof - for example, game programming area. To optimize development expenses the developers may "ignore whether the solution to a problem can be proven to be correct".--[[User:Tim32\|Tim32]] ([[User talk:Tim32\|talk]]) 22:46, 19 January 2009 (UTC)

ChristopherKingChemist at 14:37, 8 January 2009

2009-01-08T14:37:31Z

← Previous revision		Revision as of 14:37, 8 January 2009
Line 45:		Line 45:
	== Heuristic = Rules of Thumb ? ==		== Heuristic = Rules of Thumb ? ==
	Reading the article, I got the impression it means simplified calculations, perhaps when not enough accurate data exists) that work well enough within certain agreed parameters. The human equivalent seems to be "rule of thumb" which are good enough for non-critical realworld situations. Is this correct ? A couple of real computer examples in layman's terms would improve the article I think. [[User:Rcbutcher\|Rcbutcher]] ([[User talk:Rcbutcher\|talk]]) 15:13, 10 July 2008 (UTC)		Reading the article, I got the impression it means simplified calculations, perhaps when not enough accurate data exists) that work well enough within certain agreed parameters. The human equivalent seems to be "rule of thumb" which are good enough for non-critical realworld situations. Is this correct ? A couple of real computer examples in layman's terms would improve the article I think. [[User:Rcbutcher\|Rcbutcher]] ([[User talk:Rcbutcher\|talk]]) 15:13, 10 July 2008 (UTC)

			Along those same lines, is the lead paragraph even correct? Is a heuristic algorithm really "an algorithm that ignores whether the solution to a problem can be proven to be correct"? I thought it was an algorithm that couldn't be proven to give the best answer. (I'm out of my field, here.)--[[User:Popnose\|Christopher King]] ([[User talk:Popnose\|talk]]) 14:37, 8 January 2009 (UTC)

Rcbutcher: /* Heuristic = Rules of Thumb ? */

2008-07-10T15:13:56Z

Heuristic = Rules of Thumb ?

← Previous revision		Revision as of 15:13, 10 July 2008
Line 44:		Line 44:

	== Heuristic = Rules of Thumb ? ==		== Heuristic = Rules of Thumb ? ==
	Reading the article, I got the impression it means simplified calculations that work well enough within certain agreed parameters. The human equivalent seems to be "rule of thumb" which are good enough for non-critical realworld situations. Is this correct ? A couple of real computer examples in layman's terms would improve the article I think. [[User:Rcbutcher\|Rcbutcher]] ([[User talk:Rcbutcher\|talk]]) 15:13, 10 July 2008 (UTC)		Reading the article, I got the impression it means simplified calculations, perhaps when not enough accurate data exists) that work well enough within certain agreed parameters. The human equivalent seems to be "rule of thumb" which are good enough for non-critical realworld situations. Is this correct ? A couple of real computer examples in layman's terms would improve the article I think. [[User:Rcbutcher\|Rcbutcher]] ([[User talk:Rcbutcher\|talk]]) 15:13, 10 July 2008 (UTC)

Rcbutcher: /* Reference */

2008-07-10T15:13:14Z

Reference

← Previous revision		Revision as of 15:13, 10 July 2008
Line 42:		Line 42:
	What's the reference to "Pearl (1984)"?		What's the reference to "Pearl (1984)"?
	[[User:Houseofwealth\|Houseofwealth]] ([[User talk:Houseofwealth\|talk]]) 23:16, 19 December 2007 (UTC)		[[User:Houseofwealth\|Houseofwealth]] ([[User talk:Houseofwealth\|talk]]) 23:16, 19 December 2007 (UTC)

			== Heuristic = Rules of Thumb ? ==
			Reading the article, I got the impression it means simplified calculations that work well enough within certain agreed parameters. The human equivalent seems to be "rule of thumb" which are good enough for non-critical realworld situations. Is this correct ? A couple of real computer examples in layman's terms would improve the article I think. [[User:Rcbutcher\|Rcbutcher]] ([[User talk:Rcbutcher\|talk]]) 15:13, 10 July 2008 (UTC)