Abstract
This survey of heuristic programming starts by considering the nature of an algorithm as an automatic and precise process. A heuristic, by contrast, in an approximate and uncertain process, although algorithms and heuristics should be regarded as lying on a continuum. An examination of various applications of heuristics follows, showing the wide range of their use from game playing and logic theorem proving to shop floor scheduling and natural language programming.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
