{"responseHeader":{"status":0,"QTime":6,"params":{"q":"{!q.op=AND}id:\"99762\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Gu-Parallel_Algorithms.pdf","thumb_s":"/31/9b/319b9c792d56e6f3c39e31c331e000361eeea2f4.jpg","oldid_t":"compsci 7875","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/45/28/45289534a50bf001f9d4806dd1bc8cbafa5417af.pdf","title_t":"Page 114","ocr_t":"96 but also more importantly a measure of its inherent intelligence. The accuracy of a heuristic is simply an indication of how effective the heuristic is in guiding a search and in cutting down the search space, etc. The discussion of the heuristic accuracy may bring together a variety of individual search problems to form a spectrum, a.s shown in Figure 3.7. The qualitative coherent relations among several important concepts, such as good or poor heuris-tics (the heuristic accuracy), backtracking intensity, smartness or blindness of the search and tightness of constraints, are clear to see. The left first three milestones in Figure 3. 7 fall into the category of backtrackbounded search. The leftmost one is the worst case in backtrack-bounded search where there is no heuristic which is applied to direct the search. The entire search is a totally blind systematic generation and testing of all possible solution tuples. The rightmost milestone represents a backtrack-free search, i.e., whose heuristic is one hundred per cent accurate in directing the search to locate the solutions. In a CLP backtracking search, relational constraints (i .e., Ci,j) express declarative knowledge given prior to the problem and determine the tightness of the relational constraints and therefore the amount of work spent for the CLP backtracking brute-force fully backtracking search no heuristics backtracking intensive search poor heuristics less backtracking search good heuristics backtracking free search best heuristics (one end of spectrum) ---------------------> (other end of spectrum) [blind search] [smartest search] Figure 3. 7. The Spectrum of Backtracking Intensity","id":99762,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745543168002}]},"highlighting":{"99762":{"ocr_t":[]}}}