1133 search results - page 11 / 227 » Best Practices in e-Assessment |
283
click to vote
ISSAC
2011
Springer
14 years 9 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
167
click to vote
IACR
2011
14 years 5 months ago
2011
We present the hash-based signature scheme XMSS. It is the first provably (forward) secure and practical signature scheme with minimal security requirements: a pseudorandom and a ...
151
click to vote
GECCO
1999
Springer
15 years 10 months ago
1999
Springer
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
150
click to vote
IEICET
2008
15 years 6 months ago
2008
Obtaining the best linear unbiased estimator (BLUE) of noisy signals is a traditional but powerful approach to noise reduction. Explicitly computing the BLUE usually requires the ...
153
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...