{"responseHeader":{"status":0,"QTime":6,"params":{"q":"{!q.op=AND}id:\"99731\"","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":"/4a/88/4a88844936163b74ecad02db85346029ad75ff3f.jpg","oldid_t":"compsci 7844","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/ae/14/ae14aefd5a1c0b2c25258e2a260e94e5faaeb9cf.pdf","title_t":"Page 83","ocr_t":"65 5. find all possible solutions; 6. prove no solution exists; and 7. find an optimal solution. Backtracking algorithms determine problem solutions by systematically searching through the solution space for the given problem instance. This search is facilitated by using a tree organization for the problem space. A tree is a graph in which each node (except one root node) has only one parent. A node in a tree that has no successors is called leaf node, or a terminal node. A uniform tree of depth n is a tree in which every node at depth smaller than n has the same number of successors whereas all nodes at depth n are leaves. The size of a tree is defined as the number of leaf nodes it has. Each level of the tree represents a variable in an n-tuple solution and each node at a level assigns a value from Si for that variable represented by that level. The tree organization of the entire problem space is referred to as a search tree. For the same problem many search trees may be possible. The size of a search tree is determined by the heuristics utilized and prior knowledge about the problem. Each node in the tree defines a search state , S. Each search state cuts down the problem space and produces a subspace, or a subtree. The solution states are those search states S for which the path from the root to S defines a tuple which is a member of the set of solutions in the problem space. Among all terms described above, the concept of the search state is of significant importance. Definition 3.1: A search state in a search space is solely determined by a node on a search tree. A direct embodiment of a search state in a CLP backtracking search consists of","id":99731,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745530585089}]},"highlighting":{"99731":{"ocr_t":[]}}}