http://wiki.karljones.com/index.php?action=history&feed=atom&title=Heuristic_%28computer_science%29 2026-10-23T13:34:48Z Revision history for this page on the wiki MediaWiki 1.24.2 http://wiki.karljones.com/index.php?title=Heuristic_(computer_science)&diff=17449&oldid=prev 2016-08-29T16:59:01Z

<p>‎<span dir="auto"><span class="autocomment">External links</span></span></p> <table class='diff diff-contentalign-left'> <col class='diff-marker' /> <col class='diff-content' /> <col class='diff-marker' /> <col class='diff-content' /> <tr style='vertical-align: top;'> <td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 16:59, 29 August 2016</td> </tr><tr><td colspan="2" class="diff-lineno">Line 22:</td> <td colspan="2" class="diff-lineno">Line 22:</td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>== External links ==</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>== External links ==</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)]<del class="diffchange diffchange-inline">]</del></div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)] <ins class="diffchange diffchange-inline">@ Wikipedia</ins></div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Artificial intelligence]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Artificial intelligence]]</div></td></tr> <tr><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Computer science]]</div></td><td class='diff-marker'>&#160;</td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Computer science]]</div></td></tr> </table>

Karl Jones http://wiki.karljones.com/index.php?title=Heuristic_(computer_science)&diff=17448&oldid=prev 2016-08-29T16:55:46Z

<p>Created page with &quot;In <a href="/index.php/Computer_science" title="Computer science">computer science</a>, <a href="/index.php/Artificial_intelligence" title="Artificial intelligence">artificial intelligence</a>, and <a href="/index.php/Mathematical_optimization" title="Mathematical optimization">mathematical optimization</a>, a &#039;&#039;&#039;heuristic&#039;&#039;&#039; is a technique designed for solving a problem more quickly when clas...&quot;</p> <p><b>New page</b></p><div>In [[computer science]], [[artificial intelligence]], and [[mathematical optimization]], a '''heuristic''' is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution.<br /> <br /> == Description ==<br /> <br /> This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.<br /> <br /> A heuristic function, also called simply a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. For example, it may approximate the exact solution.<br /> <br /> == See also ==<br /> <br /> * [[Algorithm]]<br /> * [[Artificial intelligence]]<br /> * [[Constructive heuristic]]<br /> * [[Genetic algorithm]]<br /> * [[Heuristic]]<br /> * [[Heuristic routing]]<br /> * [[Heuristic evaluation]]: Method for identifying usability problems in user interfaces.<br /> * [[Metaheuristic]]: Methods for controlling and tuning basic heuristic algorithms, usually with usage of memory and learning.<br /> * [[Matheuristics]]: Optimization algorithms made by the interoperation of metaheuristics and mathematical programming (MP) techniques.<br /> Reactive search optimization: Methods using online [[machine learning]] principles for self-tuning of heuristics.<br /> <br /> == External links ==<br /> <br /> * [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)]]<br /> <br /> <br /> [[Category:Artificial intelligence]]<br /> [[Category:Computer science]]</div>

Karl Jones