BALANCEABLE DATA STRUCTURE WITH ELEMENT PRIORITIES IN THE PROBLEM OF DISCRETE INFORMATION SOURCE MODELING
Annotation
The features of developing a balanceable data structure focused on accelerated access to elements with high priority are considered. Similar structures can be used in problems of modeling discrete information sources. A self-balancing binary search tree is proposed, optimized for efficient storage and retrieval of data based on priorities that correlate with the probability of symbol generation. The solution overcomes the limitations of existing data structures, taking into account memory and performance requirements in the context of specific information processing tasks.
Keywords
Постоянный URL
Articles in current issue
- CLASSIFICATION OF HEART RHYTHM DISORDER EPISODES BY INFORMATIVE FEATURES IN THE ELECTROCARDIOGRAM TIME DOMAIN
- USING DEEP LEARNING IN PNEUMONIA DIAGNOSIS FROM X-RAYS PATTERNS
- DATA MINING IN THE DIAGNOSIS OF ANEMIA BY CLINICAL INDICATORS
- METHODS FOR OPTIMIZING NEURAL NETWORK MODELS
- RANDOM NUMBER GENERATION FOR INTERACTIVE APPLICATIONS USING EXTERNAL SENSORS
- METHODS OF LOAD BALANCING IN HIGHLY LOADED SYSTEMS
- BALANCEABLE DATA STRUCTURE WITH ELEMENT PRIORITIES IN THE PROBLEM OF DISCRETE INFORMATION SOURCE MODELING
- STUDY OF THE VARIABILITY OF NATURAL-TERRITORIAL COMPLEXES OF THE TAZ PENINSULA BASED ON MULTISPECTRAL AND RADAR SPACE SURVEY DATA
- MODEL ESTIMATES OF PARAMETERS OF PASSIVE RADIO SYSTEMS FOR MONITORING LIGHTNING ACTIVITY
- INFORMATION AND ANALYTICAL SERVICE: APPROACH TO ANALYZING GEOSPATIAL DATA FROM SATELLITE-BASED MONITORING