4541 search results - page 677 / 909 » Cache-Oblivious Algorithms and Data Structures |
270
click to vote
APLAS
2006
ACM
15 years 11 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...
207
click to vote
COOPIS
2004
IEEE
15 years 11 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...
214
click to vote
ECRTS
2006
IEEE
15 years 10 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...
190
click to vote
ITICSE
2010
ACM
15 years 9 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
200
click to vote
CP
2008
Springer
15 years 9 months ago
2008
Springer
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...