2996 search results - page 465 / 600 » Numberings and Randomness |
145
click to vote
ICTAI
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between object...
203
click to vote
CIAC
1994
Springer
15 years 10 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
194
click to vote
SPAA
1994
ACM
15 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
166
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
156
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...