Results 271 to 280 of about 101,086 (306)
Some of the next articles are maybe not open access.
Behavioural Processes, 2005
Simple heuristics may help explain how even a spider, despite its minute brain, can be disturbingly intelligent. Hutchinson and Gigerenzer suggest that the generalist-specialist distinction (or more accurately the predictability-unpredictability distinction) may be related to a species' level of reliance on simple heuristics, and spider behaviour may ...
Fiona R, Cross, Robert R, Jackson
openaire +2 more sources
Simple heuristics may help explain how even a spider, despite its minute brain, can be disturbingly intelligent. Hutchinson and Gigerenzer suggest that the generalist-specialist distinction (or more accurately the predictability-unpredictability distinction) may be related to a species' level of reliance on simple heuristics, and spider behaviour may ...
Fiona R, Cross, Robert R, Jackson
openaire +2 more sources
Artificial Intelligence, 1982
Abstract Builders of expert rule-based systems attribute the impressive performance of their programs to the corpus of knowledge they embody: a large network of facts to provide breadth of scope, and a large array of informal judgmental rules (heuristics) which guide the system toward plausible paths to follow and away from implausible ones. Yet what
openaire +1 more source
Abstract Builders of expert rule-based systems attribute the impressive performance of their programs to the corpus of knowledge they embody: a large network of facts to provide breadth of scope, and a large array of informal judgmental rules (heuristics) which guide the system toward plausible paths to follow and away from implausible ones. Yet what
openaire +1 more source
ICGA Journal, 1992
A new move-ordering method is introduced: the countermove heuristic. It shows similarities with some previously described techniques, but differs sufficiently for a test of its effectiveness to be undertaken. The technique is based on the assumption that many moves have a “natural” response, irrespective of the actual position in which the moves occur.
openaire +2 more sources
A new move-ordering method is introduced: the countermove heuristic. It shows similarities with some previously described techniques, but differs sufficiently for a test of its effectiveness to be undertaken. The technique is based on the assumption that many moves have a “natural” response, irrespective of the actual position in which the moves occur.
openaire +2 more sources
ICGA Journal, 1983
This paper presents the history heuristic, an inexpensive way to re-order moves dynamically at interior nodes of search trees. This method is experimentally shown to decrease the running time of a chess program by 21%.
openaire +1 more source
This paper presents the history heuristic, an inexpensive way to re-order moves dynamically at interior nodes of search trees. This method is experimentally shown to decrease the running time of a chess program by 21%.
openaire +1 more source
Heuristics for the Phylogeny Problem
Journal of Heuristics, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexandre A. Andreatta, Celso C. Ribeiro
openaire +1 more source
gauging the heuristic value of heuristics
Behavioral and Brain Sciences, 2005heuristics are necessary but far from sufficient explanations for moral judgment. this commentary stresses: (a) the need to complement cold, cognitive-economizing functionalist accounts with hot, value-expressive, social-identity-affirming accounts; and (b) the importance of conducting reflective-equilibrium thought and laboratory experiments that ...
openaire +1 more source
2023
This thesis centers on the topic of how to automatically combine multiple heuristics. For most computationally challenging problems, there exist multiple heuristics, and it is generally the case that any such heuristic exploits only a limited number of aspects among all the possible problem characteristics that we can think of, and by definition, is ...
openaire +1 more source
This thesis centers on the topic of how to automatically combine multiple heuristics. For most computationally challenging problems, there exist multiple heuristics, and it is generally the case that any such heuristic exploits only a limited number of aspects among all the possible problem characteristics that we can think of, and by definition, is ...
openaire +1 more source
1997
An essential heuristic in the SHUNYATA program is the composition heuristic which produces predicates and formulas forming the central “ideas” of proofs. In the proof of a rather simple theorem in mathematical logic, it generates a predicate. In the proof of Godel's incompleteness theorem, it generates an undecidable formula.
openaire +1 more source
An essential heuristic in the SHUNYATA program is the composition heuristic which produces predicates and formulas forming the central “ideas” of proofs. In the proof of a rather simple theorem in mathematical logic, it generates a predicate. In the proof of Godel's incompleteness theorem, it generates an undecidable formula.
openaire +1 more source
Notes on "Heuristic classification"
Artificial Intelligence, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source