DOCSLIB.ORG

Solving Multistage Influence Diagrams Using Branch-And-Bound Search

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Solving Multistage Influence Diagrams Using Branch-And-Bound Search Solving Multistage Influence Diagrams using Branch-and-Bound Search Changhe Yuan, Xiaojian Wu and Eric A. Hansen Department of Computer Science and Engineering Mississippi State University Mississippi State, MS 39762 fcyuan,[email protected], [email protected] Abstract A branch-and-bound approach to influence diagram eval- uation appears to have been first suggested by Pearl [16]. He proposed it as an improvement over the classic method A branch-and-bound approach to solving influ- of unfolding an influence diagram into a decision tree and ence diagrams has been previously proposed in solving it using the rollback method, which itself is a form the literature, but appears to have never been of dynamic programming [7]. In Pearl’s words: implemented and evaluated – apparently due to the difficulties of computing effective bounds for the branch-and-bound search. In this paper, A hybrid method of evaluating influence dia- we describe how to efficiently compute effective grams naturally suggests itself. It is based on bounds, and we develop a practical implementa- the realization that decision trees need not ac- tion of depth-first branch-and-bound search for tually be generated and stored in their total- influence diagram evaluation that outperforms ity to produce the optimal policy. A decision existing methods for solving influence diagrams tree can also be evaluated by traversing it in a with multiple stages. depth-first, backtracking manner using a mea- ger amount of storage space (proportional to the depth of the tree). Moreover, branch-and-bound techniques can be employed to prune the search 1 Introduction space and permit an evaluation without exhaus- tively traversing the entire tree... an influence di- An influence diagram [7] is a compact representation of agram can be evaluated by sequentially instan- the relations among random variables, decisions, and pref- tiating the decision and observation nodes (in erences in a domain that provides a framework for decision chronological order) while treating the remain- making under uncertainty. Many algorithms have been de- ing chance nodes as a Bayesian network that sup- veloped to solve influence diagrams [2, 3, 8, 15, 17, 18, plies the probabilistic parameters necessary for 19, 21]. Most of these algorithms, whether they build a tree evaluation. (p. 311) secondary structure or not, are based on the bottom-up dy- namic programming approach. They start by solving small However, neither Pearl nor anyone else appears to have low-level decision problems and gradually build on these followed up on this suggestion and implemented such an results to solve larger problems until the solution to the algorithm. The apparent reason is the difficulty of com- global-level decision problem is found. The drawback of puting effective bounds to prune the search tree. Qi and these methods is that they can waste computation in solv- Poole [17] proposed a similar search-based method for ing decision scenarios that have zero probability or that are solving influence diagrams, but with no method for com- unreachable from any initial state by following an optimal puting bounds; in fact, their implementation relied on the decision policy. trivial infinity upper bound to guide the search. Recently, This drawback can be overcome by adopting a branch-and- Marinescu [12] proposed a related search-based approach bound approach to solving an influence diagram that uses to influence diagram evaluation. But again, he proposed no a search tree to represent all possible decision scenarios. method for computing bounds; his implementation relies This approach can use upper bounds on maximum utility on brute-force search. Even without bounds to prune the to prune branches of the search tree that correspond to low- search space, note that both Qi and Poole and Marinescu quality decisions that cannot be part of an optimal policy; argue that a search-based approach has advantages – for it can also prune branches that have zero probability. example, it can prune branches that have zero probability. In this paper, we describe an implemented depth-first assumed for an influence diagram, which means the infor- branch-and-bound search algorithm for influence diagram mation variables of earlier decisions are also information evaluation that includes efficient techniques for comput- variables of later decisions. We call these past information ing bounds to prune the search tree. To compute effec- variables the history, and, for convenience, we assume that tive bounds, our algorithm adapts and integrates two pre- there are explicit information arcs from history information vious contributions. First, we adapt the work of Nilsson variables to decision variables. Finally, each utility node and Hohle¨ [14] on computing an upper bound on the max- Ui 2 U represents a function that maps each configuration imum expected utility of an influence diagram. The moti- of its parents to a utility value the represents the prefer- vation for their work was to bound the quality of strategies ence of the decision maker. (Utility variables typically do found by an approximation algorithm for solving limited- not have other variables as children except multi-attribute memory influence diagrams, and their bounds are not in utility/super-value variables.) a form that can be directly used for branch-and-bound The decision variables in an influence diagram are typically search. We show how to adapt their approach to branch- assumed to be temporally ordered, i.e., the decisions have and-bound search. Second, we adapt the recent work of to be made in a particular order. Suppose there are n deci- Yuan and Hansen [20] on solving the MAP problem for sion variables D ;D ; :::; D in an influence diagram. The Bayesian networks using branch-and-bound search. Their 1 2 n decision variables partition the variables in X into a col- work describes an incremental method for computing upper lection of disjoint sets I ; I ; :::; I . For each k, where bounds based on join tree evaluation that we show allows 0 1 n 0 < k < n, I is the set of chance variables that must such bounds to be computed efficiently during branch-and- k be observed between D and D . I is the set of initial bound search. In addition, we describe some novel methods k k+1 0 evidence variables that must be observed before D . I is for constructing the search tree and computing probabilities 1 n the set of variables left unobserved when decision D is and bounds that contribute to an efficient implementation. n made. Therefore, a partial order ≺ is defined on the influ- Our experimental results show that this approach leads to ence diagram over X [ D, as follows: an exact algorithm for solving influence diagrams that out- performs existing methods for solving multistage influence I0 ≺ D1 ≺ I1 ≺ ::: ≺ Dn ≺ In: (1) diagrams. A solution to the decision problem defined by an influence 2 Background diagram is a series of decision rules for the decision vari- ables. A decision rule for Dk is a mapping from each con- figuration of its parents to one of the actions defined by We begin with a brief review of influence diagrams and the decision variable. A decision policy (or strategy) is a algorithms for solving them. We also introduce an example series of decision rules with one decision rule for each de- of multi-stage decision making that will serve to illustrate cision variable. The goal of solving an influence diagram the results of the paper. is to find an optimal decision policy that maximizes the ex- pected utility. The maximum expected utility is equal to 2.1 Influence Diagrams X X X X max ::: max P (XjD) Uj(P a(Uj)): D1 Dn An influence diagram is a directed acyclic graph G contain- I0 In−1 In j ing variables V of a decision domain. The variables can be In general, the summations and maximizations are not classified into three groups, V = X [ D [ U, where X is commutable. The methods presented in Section 2.3 differ the set of oval-shaped chance variables that specify the un- in the various techniques they use to carry out the summa- certain decision environment, D is the set of square-shaped tions and maximizations in this order. decision variables that specify the possible decisions to be made in the domain, and U are the diamond-shaped util- Recent research has begun to relax the assumption of or- ity variables representing a decision maker’s preferences. dered decisions. In particular, Jensen proposes the frame- As in a Bayesian network, each chance variable Xi 2 X work of unconstrained influence diagrams to allow a partial is associated with a conditional probability distribution ordering among the decisions [9]. Other research relaxes P (XijP a(Xi)), where P a(Xi) is the set of parents of Xi the no-forgetting assumption, in particular, the framework in G. Each decision variable Dj 2 D has multiple informa- of limited-memory influence diagrams [10]. Although the tion states, where an information state is an instantiation of approach we develop can be extended to these frameworks, the variables with arcs leading into Dj; the selected action we do not consider the extension in this paper. is conditioned on the information state. Incoming arcs into a decision variable are called information arcs; variables at 2.2 Example the origin of these arcs are assumed to be observed before the decision is made. These variables are called the infor- To illustrate decision making using multi-stage influence mation variables of the decision. No-forgetting is typically diagrams, consider a simple maze navigation problem [6, (1,1) ns_0 (2) ns_1 (9) es_0 (3) es_1 (10) x_2 (14) x_0 (0) x_1 (7) d_0 (6) d_1 (13) u y_2 (15) y_0 (1) y_1 (8) ss_0 (4) ss_1 (11) (7,9) ws_0 (5) ws_1 (12) (a) (b) (a) Figure 1: Two maze domains.
Load more

Recommended publications
  • Adversarial Search
    Adversarial Search In which we examine the problems that arise when we try to plan ahead in a world where other agents are planning against us. Outline 1. Games 2. Optimal Decisions in Games 3. Alpha-Beta Pruning 4. Imperfect, Real-Time Decisions 5. Games that include an Element of Chance 6. State-of-the-Art Game Programs 7. Summary 2 Search Strategies for Games • Difference to general search problems deterministic random – Imperfect Information: opponent not deterministic perfect Checkers, Backgammon, – Time: approximate algorithms information Chess, Go Monopoly incomplete Bridge, Poker, ? information Scrabble • Early fundamental results – Algorithm for perfect game von Neumann (1944) • Our terminology: – Approximation through – deterministic, fully accessible evaluation information Zuse (1945), Shannon (1950) Games 3 Games as Search Problems • Justification: Games are • Games as playground for search problems with an serious research opponent • How can we determine the • Imperfection through actions best next step/action? of opponent: possible results... – Cutting branches („pruning“) • Games hard to solve; – Evaluation functions for exhaustive: approximation of utility – Average branching factor function chess: 35 – ≈ 50 steps per player ➞ 10154 nodes in search tree – But “Only” 1040 allowed positions Games 4 Search Problem • 2-player games • Search problem – Player MAX – Initial state – Player MIN • Board, positions, first player – MAX moves first; players – Successor function then take turns • Lists of (move,state)-pairs – Goal test
    [Show full text]
  • Artificial Intelligence Spring 2019 Homework 2: Adversarial Search
    Artificial Intelligence Spring 2019 Homework 2: Adversarial Search PROGRAMMING In this assignment, you will create an adversarial search agent to play the 2048-puzzle game. A demo of ​ ​ the game is available here: gabrielecirulli.github.io/2048. ​ ​ I. 2048 As A Two-Player Game ​ II. Choosing a Search Algorithm: Expectiminimax ​ III. Using The Skeleton Code ​ IV. What You Need To Submit ​ V. Important Information ​ VI. Before You Submit ​ I. 2048 As A Two-Player Game 2048 is played on a 4×4 grid with numbered tiles which can slide up, down, left, or right. This game can ​ ​ be modeled as a two player game, in which the computer AI generates a 2- or 4-tile placed randomly on the board, and the player then selects a direction to move the tiles. Note that the tiles move until they either (1) collide with another tile, or (2) collide with the edge of the grid. If two tiles of the same number collide in a move, they merge into a single tile valued at the sum of the two originals. The resulting tile cannot merge with another tile again in the same move. Usually, each role in a two-player games has a similar set of moves to choose from, and similar objectives (e.g. chess). In 2048 however, the player roles are inherently asymmetric, as the Computer AI ​ ​ places tiles and the Player moves them. Adversarial search can still be applied! Using your previous experience with objects, states, nodes, functions, and implicit or explicit search trees, along with our skeleton code, focus on optimizing your player algorithm to solve 2048 as efficiently and consistently ​ ​ as possible.
    [Show full text]
  • Best-First and Depth-First Minimax Search in Practice
    Best-First and Depth-First Minimax Search in Practice Aske Plaat, Erasmus University, [email protected] Jonathan Schaeffer, University of Alberta, [email protected] Wim Pijls, Erasmus University, [email protected] Arie de Bruin, Erasmus University, [email protected] Erasmus University, University of Alberta, Department of Computer Science, Department of Computing Science, Room H4-31, P.O. Box 1738, 615 General Services Building, 3000 DR Rotterdam, Edmonton, Alberta, The Netherlands Canada T6G 2H1 Abstract Most practitioners use a variant of the Alpha-Beta algorithm, a simple depth-®rst pro- cedure, for searching minimax trees. SSS*, with its best-®rst search strategy, reportedly offers the potential for more ef®cient search. However, the complex formulation of the al- gorithm and its alleged excessive memory requirements preclude its use in practice. For two decades, the search ef®ciency of ªsmartº best-®rst SSS* has cast doubt on the effectiveness of ªdumbº depth-®rst Alpha-Beta. This paper presents a simple framework for calling Alpha-Beta that allows us to create a variety of algorithms, including SSS* and DUAL*. In effect, we formulate a best-®rst algorithm using depth-®rst search. Expressed in this framework SSS* is just a special case of Alpha-Beta, solving all of the perceived drawbacks of the algorithm. In practice, Alpha-Beta variants typically evaluate less nodes than SSS*. A new instance of this framework, MTD(ƒ), out-performs SSS* and NegaScout, the Alpha-Beta variant of choice by practitioners. 1 Introduction Game playing is one of the classic problems of arti®cial intelligence.
    [Show full text]
  • General Branch and Bound, and Its Relation to A* and AO*
    ARTIFICIAL INTELLIGENCE 29 General Branch and Bound, and Its Relation to A* and AO* Dana S. Nau, Vipin Kumar and Laveen Kanal* Laboratory for Pattern Analysis, Computer Science Department, University of Maryland College Park, MD 20742, U.S.A. Recommended by Erik Sandewall ABSTRACT Branch and Bound (B&B) is a problem-solving technique which is widely used for various problems encountered in operations research and combinatorial mathematics. Various heuristic search pro- cedures used in artificial intelligence (AI) are considered to be related to B&B procedures. However, in the absence of any generally accepted terminology for B&B procedures, there have been widely differing opinions regarding the relationships between these procedures and B &B. This paper presents a formulation of B&B general enough to include previous formulations as special cases, and shows how two well-known AI search procedures (A* and AO*) are special cases o,f this general formulation. 1. Introduction A wide class of problems arising in operations research, decision making and artificial intelligence can be (abstractly) stated in the following form: Given a (possibly infinite) discrete set X and a real-valued objective function F whose domain is X, find an optimal element x* E X such that F(x*) = min{F(x) I x ~ X}) Unless there is enough problem-specific knowledge available to obtain the optimum element of the set in some straightforward manner, the only course available may be to enumerate some or all of the elements of X until an optimal element is found. However, the sets X and {F(x) [ x E X} are usually tThis work was supported by NSF Grant ENG-7822159 to the Laboratory for Pattern Analysis at the University of Maryland.
    [Show full text]
  • Trees, Binary Search Trees, Heaps & Applications Dr. Chris Bourke
    Trees Trees, Binary Search Trees, Heaps & Applications Dr. Chris Bourke Department of Computer Science & Engineering University of Nebraska|Lincoln Lincoln, NE 68588, USA [email protected] http://cse.unl.edu/~cbourke 2015/01/31 21:05:31 Abstract These are lecture notes used in CSCE 156 (Computer Science II), CSCE 235 (Dis- crete Structures) and CSCE 310 (Data Structures & Algorithms) at the University of Nebraska|Lincoln. This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License 1 Contents I Trees4 1 Introduction4 2 Definitions & Terminology5 3 Tree Traversal7 3.1 Preorder Traversal................................7 3.2 Inorder Traversal.................................7 3.3 Postorder Traversal................................7 3.4 Breadth-First Search Traversal..........................8 3.5 Implementations & Data Structures.......................8 3.5.1 Preorder Implementations........................8 3.5.2 Inorder Implementation.........................9 3.5.3 Postorder Implementation........................ 10 3.5.4 BFS Implementation........................... 12 3.5.5 Tree Walk Implementations....................... 12 3.6 Operations..................................... 12 4 Binary Search Trees 14 4.1 Basic Operations................................. 15 5 Balanced Binary Search Trees 17 5.1 2-3 Trees...................................... 17 5.2 AVL Trees..................................... 17 5.3 Red-Black Trees.................................. 19 6 Optimal Binary Search Trees 19 7 Heaps 19
    [Show full text]
  • Parallel Technique for the Metaheuristic Algorithms Using Devoted Local Search and Manipulating the Solutions Space
    applied sciences Article Parallel Technique for the Metaheuristic Algorithms Using Devoted Local Search and Manipulating the Solutions Space Dawid Połap 1,* ID , Karolina K˛esik 1, Marcin Wo´zniak 1 ID and Robertas Damaševiˇcius 2 ID 1 Institute of Mathematics, Silesian University of Technology, Kaszubska 23, 44-100 Gliwice, Poland; [email protected] (K.K.); [email protected] (M.W.) 2 Department of Software Engineering, Kaunas University of Technology, Studentu 50, LT-51368, Kaunas, Lithuania; [email protected] * Correspondence: [email protected] Received: 16 December 2017; Accepted: 13 February 2018 ; Published: 16 February 2018 Abstract: The increasing exploration of alternative methods for solving optimization problems causes that parallelization and modification of the existing algorithms are necessary. Obtaining the right solution using the meta-heuristic algorithm may require long operating time or a large number of iterations or individuals in a population. The higher the number, the longer the operation time. In order to minimize not only the time, but also the value of the parameters we suggest three proposition to increase the efficiency of classical methods. The first one is to use the method of searching through the neighborhood in order to minimize the solution space exploration. Moreover, task distribution between threads and CPU cores can affect the speed of the algorithm and therefore make it work more efficiently. The second proposition involves manipulating the solutions space to minimize the number of calculations. In addition, the third proposition is the combination of the previous two. All propositions has been described, tested and analyzed due to the use of various test functions.
    [Show full text]
  • Backtracking Search (Csps) ■Chapter 5 5.3 Is About Local Search Which Is a Very Useful Idea but We Won’T Cover It in Class
    CSC384: Intro to Artificial Intelligence Backtracking Search (CSPs) ■Chapter 5 5.3 is about local search which is a very useful idea but we won’t cover it in class. 1 Hojjat Ghaderi, University of Toronto Constraint Satisfaction Problems ● The search algorithms we discussed so far had no knowledge of the states representation (black box). ■ For each problem we had to design a new state representation (and embed in it the sub-routines we pass to the search algorithms). ● Instead we can have a general state representation that works well for many different problems. ● We can build then specialized search algorithms that operate efficiently on this general state representation. ● We call the class of problems that can be represented with this specialized representation CSPs---Constraint Satisfaction Problems. ● Techniques for solving CSPs find more practical applications in industry than most other areas of AI. 2 Hojjat Ghaderi, University of Toronto Constraint Satisfaction Problems ●The idea: represent states as a vector of feature values. We have ■ k-features (or variables) ■ Each feature takes a value. Domain of possible values for the variables: height = {short, average, tall}, weight = {light, average, heavy}. ●In CSPs, the problem is to search for a set of values for the features (variables) so that the values satisfy some conditions (constraints). ■ i.e., a goal state specified as conditions on the vector of feature values. 3 Hojjat Ghaderi, University of Toronto Constraint Satisfaction Problems ●Sudoku: ■ 81 variables, each representing the value of a cell. ■ Values: a fixed value for those cells that are already filled in, the values {1-9} for those cells that are empty.
    [Show full text]
  • Best-First Minimax Search Richard E
    Artificial Intelligence ELSEVIER Artificial Intelligence 84 ( 1996) 299-337 Best-first minimax search Richard E. Korf *, David Maxwell Chickering Computer Science Department, University of California, Los Angeles, CA 90024, USA Received September 1994; revised May 1995 Abstract We describe a very simple selective search algorithm for two-player games, called best-first minimax. It always expands next the node at the end of the expected line of play, which determines the minimax value of the root. It uses the same information as alpha-beta minimax, and takes roughly the same time per node generation. We present an implementation of the algorithm that reduces its space complexity from exponential to linear in the search depth, but at significant time cost. Our actual implementation saves the subtree generated for one move that is still relevant after the player and opponent move, pruning subtrees below moves not chosen by either player. We also show how to efficiently generate a class of incremental random game trees. On uniform random game trees, best-first minimax outperforms alpha-beta, when both algorithms are given the same amount of computation. On random trees with random branching factors, best-first outperforms alpha-beta for shallow depths, but eventually loses at greater depths. We obtain similar results in the game of Othello. Finally, we present a hybrid best-first extension algorithm that combines alpha-beta with best-first minimax, and performs significantly better than alpha-beta in both domains, even at greater depths. In Othello, it beats alpha-beta in two out of three games. 1. Introduction and overview The best chess machines, such as Deep-Blue [lo], are competitive with the best humans, but generate billions of positions per move.
    [Show full text]
  • Binary Search Trees! – These Are "Nonlinear" Implementations of the ADT Table
    Data Structures Topic #8 Today’s Agenda • Continue Discussing Table Abstractions • But, this time, let’s talk about them in terms of new non-linear data structures – trees – which require that our data be organized in a hierarchical fashion Tree Introduction • Remember when we learned about tables? – We found that none of the methods for implementing tables was really adequate. – With many applications, table operations end up not being as efficient as necessary. – We found that hashing is good for retrieval, but doesn't help if our goal is also to obtain a sorted list of information. Tree Introduction • We found that the binary search also allows for fast retrieval, – but is limited to array implementations versus linked list. – Because of this, we need to move to more sophisticated implementations of tables, using binary search trees! – These are "nonlinear" implementations of the ADT table. Tree Terminology • Trees are used to represent the relationship between data items. – All trees are hierarchical in nature which means there is a parent-child relationship between "nodes" in a tree. – The lines between nodes are called directed edges. – If there is a directed edge from node A to node B -- then A is the parent of B and B is a child of A. Tree Terminology • Children of the same parent are called siblings. • Each node in a tree has at most one parent, starting at the top with the root node (which has no parent). • Parent of n The node directly above node n in the tree • Child of n The node directly below the node n in the tree Tree
    [Show full text]
  • Branch and Bound
    Branch and Bound • Used to find optimal solution to many optimization problems, especially in discrete and combinatorial optimization • Systematic enumeration of all candidate solutions, discarding large subsets of fruitless candidates by using upper and lower estimated bounds of quantity being optimized Terminology Definition 1 Live node is a node that has been generated but whose children have not yet been generated. Definition 2 E-node is a live node whose children are currently being explored. In other words, an E-node is a node currently being expanded. Definition 3 Dead node is a generated node that is not to be expanded or explored any further. All children of a dead node have already been expanded. Definition 4 Branch-and-bound refers to all state space search methods in which all children of an E-node are generated before any other live node can become the E-node. • Used for state space search – In BFS, exploration of a new node cannot begin until the node currently being explored is fully explored General method • Both BFS and DFS generalize to branch-and-bound strategies – BFS is an FIFO search in terms of live nodes ∗ List of live nodes is a queue – DFS is an LIFO search in terms of live nodes ∗ List of live nodes is a stack • Just like backtracking, we will use bounding functions to avoid generating subtrees that do not contain an answer node • Example: 4-queens – FIFO branch-and-bound algorithm ∗ Initially, there is only one live node; no queen has been placed on the chessboard ∗ The only live node becomes E-node ∗ Expand and
    [Show full text]
  • Monte Carlo *-Minimax Search
    Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Monte Carlo *-Minimax Search Marc Lanctot Abdallah Saffidine Department of Knowledge Engineering LAMSADE, Maastricht University, Netherlands Universite´ Paris-Dauphine, France [email protected] abdallah.saffi[email protected] Joel Veness and Christopher Archibald, Mark H. M. Winands Department of Computing Science Department of Knowledge Engineering University of Alberta, Canada Maastricht University, Netherlands fveness@cs., [email protected] [email protected] Abstract the search enhancements from the classic αβ literature can- not be easily adapted to MCTS. The classic algorithms for This paper introduces Monte Carlo *-Minimax stochastic games, EXPECTIMAX and *-Minimax (Star1 and Search (MCMS), a Monte Carlo search algorithm Star2), perform look-ahead searches to a limited depth. How- for turned-based, stochastic, two-player, zero-sum ever, the running time of these algorithms scales exponen- games of perfect information. The algorithm is de- tially in the branching factor at chance nodes as the search signed for the class of densely stochastic games; horizon is increased. Hence, their performance in large games that is, games where one would rarely expect to often depends heavily on the quality of the heuristic evalua- sample the same successor state multiple times at tion function, as only shallow searches are possible. any particular chance node. Our approach com- bines sparse sampling techniques from MDP plan- One way to handle the uncertainty at chance nodes would ning with classic pruning techniques developed for be forward pruning [Smith and Nau, 1993], but the perfor- adversarial expectimax planning. We compare and mance gain until now has been small [Schadd et al., 2009].
    [Show full text]
  • Algorithm for Character Recognition Based on the Trie Structure
    University of Montana ScholarWorks at University of Montana Graduate Student Theses, Dissertations, & Professional Papers Graduate School 1987 Algorithm for character recognition based on the trie structure Mohammad N. Paryavi The University of Montana Follow this and additional works at: https://scholarworks.umt.edu/etd Let us know how access to this document benefits ou.y Recommended Citation Paryavi, Mohammad N., "Algorithm for character recognition based on the trie structure" (1987). Graduate Student Theses, Dissertations, & Professional Papers. 5091. https://scholarworks.umt.edu/etd/5091 This Thesis is brought to you for free and open access by the Graduate School at ScholarWorks at University of Montana. It has been accepted for inclusion in Graduate Student Theses, Dissertations, & Professional Papers by an authorized administrator of ScholarWorks at University of Montana. For more information, please contact [email protected]. COPYRIGHT ACT OF 1 9 7 6 Th is is an unpublished manuscript in which copyright sub ­ s i s t s , Any further r e p r in t in g of its contents must be approved BY THE AUTHOR, Ma n sfield L ibrary U n iv e r s it y of Montana Date : 1 987__ AN ALGORITHM FOR CHARACTER RECOGNITION BASED ON THE TRIE STRUCTURE By Mohammad N. Paryavi B. A., University of Washington, 1983 Presented in partial fulfillment of the requirements for the degree of Master of Science University of Montana 1987 Approved by lairman, Board of Examiners iean, Graduate School UMI Number: EP40555 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted.
    [Show full text]