A method for computing heuristics in problem solving (Q1143823): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0255(79)90024-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071730763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An admissible and optimal algorithm for searching AND/OR graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for the Success of GPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated model of problem solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics in problem representation and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Dijkstra's Shortest Path Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of admissible search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristically guided search and chromosome matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search viewed as path finding in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153626 / rank
 
Normal rank

Latest revision as of 09:12, 13 June 2024

scientific article
Language Label Description Also known as
English
A method for computing heuristics in problem solving
scientific article

    Statements

    Identifiers