617 search results - page 81 / 124 » Optimal Distributed Online Prediction using Mini-Batches |
112
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...
141
click to vote
IOPADS
1997
15 years 4 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
104
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In mobile manipulation, the position to which the robot navigates has a large influence on the ease with which a subsequent manipulation action can be performed. Whether a man...
106
click to vote
SPAA
1990
ACM
15 years 7 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...