17049 search results - page 298 / 3410 » cans 2007 |
203
click to vote
OPODIS
2003
15 years 8 months ago
2003
In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the...
184
Voted
PDPTA
2003
15 years 8 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
219
click to vote
RIVF
2003
15 years 8 months ago
2003
Abstract— This paper presents our work on supporting flexible query evaluation over large distributed, heterogeneous, and autonomous sources. Flexibility means that the query ev...
182
click to vote
SERP
2003
15 years 8 months ago
2003
Design patterns provide a medium-grained ion and can be used as an effective tool for understanding object-oriented systems. This paper presents a simple tool for the extraction o...
161
click to vote
SERP
2003
15 years 8 months ago
2003
Abstract New algorithms are constantly developed in search of better or faster results. Many variants of code are often tried while searching for the best solution. When the number...