6770 search results - page 194 / 1354 » How GPUs Work |
116
Voted
MOC
2000
15 years 2 months ago
2000
Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
92
Voted
FMSD
1998
15 years 2 months ago
1998
The bitstate hashing, or supertrace, technique was introduced in 1987 as a method to increase the quality of verification by reachability analyses for applications that defeat anal...
102
Voted
MOC
1998
15 years 2 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
112
Voted
PE
2007
Springer
15 years 2 months ago
2007
Springer
Expected slowdown has been proposed as a criterion to evaluate queue fairness. In this work we examine how the constant slowdown principle can be used as a basis for a queueing fa...
113
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...