6897 search results - page 59 / 1380 » Parallelization of Modular Algorithms |
WG
2005
Springer
14 years 2 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
PDP
2009
IEEE
14 years 3 months ago
2009
IEEE
SBASCO provides a new programming model for parallel and distributed numerical applications which exploits the combination of software components and skeletons. This paper present...
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
General purpose object-oriented programs typically aren’t embarrassingly parallel. For these applications, finding enough concurrency remains a challenge in program design. To ...
ARITH
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
CEC
2009
IEEE
14 years 3 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...