1120 search results - page 16 / 224 » time 1999 |
82
Voted
ASYNC
1999
IEEE
15 years 2 months ago
1999
IEEE
Relative Timing is introduced as an informal method for aggressive asynchronous design. It is demonstrated on three example circuits (C-Element, FIFO, and RAPPID Tag Unit), facili...
SPIRE
1999
Springer
15 years 2 months ago
1999
Springer
This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows th...
EOR
2008
14 years 10 months ago
2008
The first comprehensive survey paper on scheduling problems with separate setup times or costs was conducted by [Allahverdi, A., Gupta, J.N.D., Aldowaisan, T., 1999. A review of s...
COMBINATORICS
1999
14 years 10 months ago
1999
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...