Sciweavers

432 search results - page 56 / 87
» Internally deterministic parallel algorithms can be fast
Sort
View
FOCS
1989
IEEE
15 years 6 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
DAC
2004
ACM
15 years 5 months ago
Statistical gate delay model considering multiple input switching
There is an increased dominance of intra-die process variations, creating a need for an accurate and fast statistical timing analysis. Most of the recent proposed approaches assum...
Aseem Agarwal, Florentin Dartu, David Blaauw
146
Voted
PVM
2010
Springer
15 years 8 days ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
128
Voted
FPL
2008
Springer
122views Hardware» more  FPL 2008»
15 years 3 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno
IJRR
2007
181views more  IJRR 2007»
15 years 1 months ago
Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots
An algorithm is presented for wheeled mobile robot trajectory generation that achieves a high degree of generality and efficiency. The generality derives from numerical lineariza...
Thomas M. Howard, Alonzo Kelly