3020 search results - page 66 / 604 » Optimal partition trees |
184
click to vote
PAKDD
2007
ACM
16 years 4 days ago
2007
ACM
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
176
click to vote
MSV
2004
15 years 7 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
143
click to vote
ISSS
1999
IEEE
15 years 10 months ago
1999
IEEE
Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is...
157
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
Horizontally partitioned data caches are a popular architectural feature in which the processor maintains two or more data caches at the same level of hierarchy. Horizontally part...
145
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...