73 search results - page 4 / 15 » swap 2007 |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
OPODIS
2004
13 years 8 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 ...
ICALT
2007
IEEE
14 years 1 months ago
2007
IEEE
The vision of a common international education space includes a scenario for the composition of personalised study curricula consisting of modules offered by different universitie...
BMCBI
2006
13 years 7 months ago
2006
Background: Bioinformatics applications are now routinely used to analyze large amounts of data. Application development often requires many cycles of optimization, compiling, and...
ICDCSW
2007
IEEE
14 years 1 months ago
2007
IEEE
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...