5653 search results - page 452 / 1131 » Distributed Conceptual Structures |
190
click to vote
PODC
2004
ACM
16 years 1 months ago
2004
ACM
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems an...
199
click to vote
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
185
click to vote
ECOOPW
1998
Springer
15 years 12 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
184
click to vote
ATVA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
219
click to vote
PPSN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...