Data structures using Pascal
Introduction to probability and statistics (7th ed.)
Introduction to probability and statistics (7th ed.)
Data Structure Techniques
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
| Hi-index | 0.20 |
We introduce the concept of a possibilistic search tree. Such trees make use of fuzzy methods and the theory of possibility. They are built using the possibilistic request frequencies of applicable records relevant to a specified search. A corresponding possibilistic average search time measure is presented. Examples of possibilistic search trees with their respective possibilistic average search trees with their corresponding probabilistic measures are evaluated. Some techniques for obtaining the possibilistic record request frequencies relevant to a specified search are examined.