13214 search results - page 2303 / 2643 » Pseudorandomness for network algorithms |
195
click to vote
FTDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
The impact of buffer management and priority scheduling is examined in stressful scenarios when the aggregate incoming traffic is higher than the output link capacity of an Asynch...
190
click to vote
HCW
1999
IEEE
15 years 11 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
166
click to vote
PG
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we introduce a new compression technique for the connectivity of a Triangulated Irregular Network (TIN) by using Delaunay triangulation. The strategy in this paper i...
177
click to vote
FPL
1999
Springer
15 years 11 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
205
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...