1133 search results - page 24 / 227 » Best Practices in e-Assessment |
132
click to vote
PODC
1996
ACM
15 years 10 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...
165
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
156
click to vote
OPODIS
2004
15 years 7 months ago
2004
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
163
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which ca...
148
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Although usability methods are widely used for evaluating conventional graphical user interfaces and websites, there is a growing concern that current approaches are inadequate fo...