Timeline for the meaning of heuristics in artificial intelligence
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 15, 2020 at 8:32 | answer | added | Yogesh Aggarwal | timeline score: 0 | |
| May 30, 2015 at 11:32 | history | tweeted | twitter.com/#!/StackCompSci/status/604611384224161792 | ||
| May 29, 2015 at 10:58 | answer | added | Juho | timeline score: 2 | |
| May 29, 2015 at 10:46 | comment | added | babou | The concept of a heuristic is to be understood with respect to a given purpose. For example, given a problem, you may have an algorithmic solution providing precisely the answer(s) you desire, but that is expressed as a non-deterministic algorithm, hence leaving room for different computation strategies which may results in computations that have different costs for achieving the same result. In such a case, you may want to use heuristics to make non-deterministic choices that may hopefully lead to lower computation costs. | |
| May 29, 2015 at 7:57 | comment | added | Raphael | Still, heuristics can be studies in a rigorous way. If the author calls model assumptions "heuristics", they may not solve the problem they want/claim to be solving. | |
| May 29, 2015 at 7:56 | history | edited | Raphael |
edited tags
|
|
| May 29, 2015 at 7:36 | comment | added | Juho | You can find answers to your questions on Wikipedia, see e.g. metaheuristics and hyperheuristic. | |
| May 29, 2015 at 6:59 | comment | added | cgo | Thanks for your responses. A related question is ... what do 'hyperheuristics', 'meta-heuristics' mean? Why are they 'beyond' the normal heuristics? | |
| May 29, 2015 at 6:06 | comment | added | iLoveCamelCase | Heuristic generally is an approximate approach to solve any problem. In this case it could be the approximate model of particle behaviour. | |
| May 29, 2015 at 5:52 | history | asked | cgo | CC BY-SA 3.0 |