{"responseHeader":{"status":0,"QTime":6,"params":{"q":"{!q.op=AND}id:\"99768\"","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":"/47/9e/479e16c17e5fbbe50178258e18248307d1f16059.jpg","oldid_t":"compsci 7881","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/d9/fb/d9fbb9f29ea3e3e1615d8810853c20785330f546.pdf","title_t":"Page 120","ocr_t":"102 This model offers multiple views so that one is able to understand a heuristic by probing into the macro and/or micro structure of a heuristic and the search problem where it is applied through accuracy, backtracking efficiency, inherent parallelism a.nd time complexity, communication complexity, frequency, regularity, granularity (scope), loading effect, etc. These traits all have their extensional embodiments and can either be theoretically analyzed or experimentally collected. Based on this model, for example, one can easily trace those bottlenecks that affect the performance and could tell a heuristic (h) may give a negative performance figure as long as the condition t(C(h)) + t(F(h) x T(h)) $ t(s)- t(sh)· is met, even if h is theoretically elegant. Finally, we believe this model provides fairly comprehensive and accurate insights for further algorithm and architecture design of a heuristic. 3.5 Summary Backtracking search is a fundamental method to solve a consistent labeling problem. A sequential backtracking search is a computationally costly process since three sources of inefficiencies exist: • The size of a backtracking search tree grows exponentially in n (the depth of the tree) with the number of its leaf nodes being proportional to O(mn). • In order to make a search decision at every node visited, a large amount of processing at the node is required.","id":99768,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745545265154}]},"highlighting":{"99768":{"ocr_t":[]}}}