|
| From: | Tanguy URVOY |
| Subject: | Re: [gnugo-devel] very good news |
| Date: | Tue, 04 Feb 2003 10:44:38 +0100 |
| User-agent: | Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.2) Gecko/20021120 Netscape/7.01 |
the size of dfa database is reduced more than 3 times! i used very many iterations (10000 for the three smaller databases and many more for owl_defendpats.db).
Great! Spiral scan is not the only solution. You would probably reduce the size of the dfa by computing a special scan path for EACH database. A good heuristic would be to scan first the intersections that are the most often tested in patterns. This would put wildcards away and reduce the branching factor. -- --------------------------------------- Tanguy Urvoy http://www.irisa.fr/galion ---------------------------------------
| [Prev in Thread] | Current Thread | [Next in Thread] |