432 search results - page 10 / 87 » Internally deterministic parallel algorithms can be fast |
175
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
129
Voted
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
146
Voted
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
128
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
142
Voted
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by ap...