674 search results - page 33 / 135 » The computational complexity of the parallel knock-out probl... |
127
click to vote
CP
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
108
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
107
click to vote
ICDCS
1996
IEEE
15 years 5 months ago
1996
IEEE
We introduce a shared memory software prototype system for executing programs with nested parallelism on a network of workstations. This programming model exhibits a very convenie...
121
click to vote
IJNSEC
2008
15 years 1 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
122
click to vote
EUROPAR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...