| |
| | Cn-Cz (Site not responding. Last check: 2007-10-20) |
 | | The algorithm inductively learns a set of propositional if-then rules from a set of training examples by performing a general-to-specific beam search through rule-space for the best rule, removing training examples covered by that rule, and then repeating the process until no more good rules can be found. |
 | | There are classes for construct various sorts of queues, creating linked lists and a stack, scheduling events, creating 1-, 2-, and 3-D arrays, creating hash tables, character strings, graphics, fuzzy variables and rules, and many more general and specific tasks. |
 | | In the next step an initial network is constructed using an iterative algorithm that attempts to identify the smallest or least costly set of selection units that meet the objectives. |
| stommel.tamu.edu /~baum/linuxlist/linuxlist/node12.html (11570 words) |
|