Dynamic Memory Allocation for CMAC using Binary Search Trees
Cerebellar Model Articulation Controllers (CMACs) are a biologically-inspired neural network system suitable for trajectory control. Traditionally, CMACs have been implemented using hash-coding for their memory allocation, requiring static allocation of fixed amounts of memory in advance to the trai...
| Main Authors: | , |
|---|---|
| Format: | Conference Paper |
| Published: |
WSEAS Press
2007
|
| Subjects: | |
| Online Access: | http://www.wseas.org/ http://hdl.handle.net/20.500.11937/35772 |
| _version_ | 1848754587029209088 |
|---|---|
| author | Scarfe, Peter Lindsay, Euan |
| author_facet | Scarfe, Peter Lindsay, Euan |
| author_sort | Scarfe, Peter |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Cerebellar Model Articulation Controllers (CMACs) are a biologically-inspired neural network system suitable for trajectory control. Traditionally, CMACs have been implemented using hash-coding for their memory allocation, requiring static allocation of fixed amounts of memory in advance to the training of the system. This paper presents a method for implementing CMACs using Binary Search Trees to provide dynamic memory allocation, allowing for lower memory usage without compromising the functionality of theCMAC. |
| first_indexed | 2025-11-14T08:42:46Z |
| format | Conference Paper |
| id | curtin-20.500.11937-35772 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:42:46Z |
| publishDate | 2007 |
| publisher | WSEAS Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-357722017-01-30T13:51:40Z Dynamic Memory Allocation for CMAC using Binary Search Trees Scarfe, Peter Lindsay, Euan memory algorithms dynamic memory allocation CMAC binary search trees Cerebellar Model Articulation Controllers (CMACs) are a biologically-inspired neural network system suitable for trajectory control. Traditionally, CMACs have been implemented using hash-coding for their memory allocation, requiring static allocation of fixed amounts of memory in advance to the training of the system. This paper presents a method for implementing CMACs using Binary Search Trees to provide dynamic memory allocation, allowing for lower memory usage without compromising the functionality of theCMAC. 2007 Conference Paper http://hdl.handle.net/20.500.11937/35772 http://www.wseas.org/ WSEAS Press fulltext |
| spellingShingle | memory algorithms dynamic memory allocation CMAC binary search trees Scarfe, Peter Lindsay, Euan Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title | Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title_full | Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title_fullStr | Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title_full_unstemmed | Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title_short | Dynamic Memory Allocation for CMAC using Binary Search Trees |
| title_sort | dynamic memory allocation for cmac using binary search trees |
| topic | memory algorithms dynamic memory allocation CMAC binary search trees |
| url | http://www.wseas.org/ http://hdl.handle.net/20.500.11937/35772 |