Best heuristics aren't just trial and error
Heuristic searches don't necessarily rely on trial and error. Programs can be structured so that a heuristic method moves the search ever closer to a problem solution without the need for redundant backtracking.
Zenon Pylyshyn (1974).
Λεπτομέρειες πλοηγού
(Βοήθεια)
-
Artificial Intelligence »Artificial Intelligence
Can computers think? [1] »Can computers think? [1]
Yes: physical symbol systems can think [3] »Yes: physical symbol systems can think [3]
The Heuristic Search Assumption »The Heuristic Search Assumption
Trail and Error different from essential discrimination »Trail and Error different from essential discrimination
Best heuristics aren't just trial and error
Zenon Pylyshyn »Zenon Pylyshyn
+Σχόλια (0)
+Αναφορές (0)
+About