1096 search results - page 133 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
165
click to vote
ALENEX
2010
15 years 7 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
160
click to vote
TSMC
2002
15 years 6 months ago
2002
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
184
click to vote
AAMAS
2010
Springer
15 years 6 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
155
click to vote
CCGRID
2005
IEEE
15 years 12 months ago
2005
IEEE
Partial replication is one type of optimization to speed up execution of queries submitted to large datasets. In partial replication, a portion of the dataset is extracted, re-org...
166
click to vote
SC
2000
ACM
15 years 10 months ago
2000
ACM
This paper describes performance tuning experiences with a three-dimensional unstructured grid Euler flow code from NASA, which we have reimplemented in the PETSc framework and p...