Sciweavers

290 search results - page 9 / 58
» Comparing and managing multiple versions of slide presentati...
Sort
View
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
PPOPP
2011
ACM
12 years 10 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
CAP
2010
13 years 2 months ago
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
Mickaël Gastineau
GLOBECOM
2006
IEEE
14 years 1 months ago
Harnessing the Parity of Multiple Errors in End-to-End MAC Schemes
— We present the results of simulation experiments that compare end-to-end error management (used in controlled access MAC protocols) against hop-by-hop error management (used in...
Ghassen Ben Brahim, Bilal Khan, Ala I. Al-Fuqaha, ...
ATAL
2005
Springer
14 years 1 months ago
A comparative evaluation of agent location mechanisms in large scale MAS
Agents in open multi-agent systems (MAS) need means for locating other agents with which they may collaborate. To address this need, several agent location mechanisms were suggest...
David Ben-Ami, Onn Shehory