2498 search results - page 302 / 500 » Data Structures with Unpredictable Timing |
199
click to vote
FROCOS
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
186
click to vote
LFCS
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
155
click to vote
VRCAI
2006
ACM
16 years 13 days ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
158
click to vote
WCRE
2003
IEEE
15 years 11 months ago
2003
IEEE
As software evolves, maintenance practices require a process of accommodating changing requirements while minimizing the cost of implementing those changes. Over time, incompatibi...
180
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this paper, we present several novel strategies to improve software controlled cache utilization, so as to achieve lower power requirements for multi-media and signal processin...