4536 search results - page 702 / 908 » Contention-Sensitive Data Structures and Algorithms |
130
click to vote
APLAS
2006
ACM
15 years 6 months ago
2006
ACM
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
134
click to vote
COOPIS
2004
IEEE
15 years 6 months ago
2004
IEEE
An innate characteristic of the development of ontologies is that they are often created by independent groups of expertise, which generates the necessity of merging and aligning o...
85
Voted
BIRTHDAY
2006
Springer
15 years 6 months ago
2006
Springer
In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an...
144
Voted
DAWAK
2006
Springer
15 years 6 months ago
2006
Springer
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
134
click to vote
ECRTS
2006
IEEE
15 years 6 months ago
2006
IEEE
We consider coordinating accesses to shared data structures in multiprocessor real-time systems scheduled under preemptive global EDF. To our knowledge, prior work on global EDF h...