z-logo
open-access-imgOpen Access
Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search
Author(s) -
Richard Valenzano,
Nathan Sturtevant,
Jonathan Schaeffer
Publication year - 2014
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v28i1.8850
Subject(s) - heuristics , heuristic , quality (philosophy) , weighting , upper and lower bounds , bounded function , computer science , mathematical optimization , process (computing) , quadratic equation , mathematics , medicine , mathematical analysis , philosophy , geometry , epistemology , radiology , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom