1720 search results - page 33 / 344 » Unranking Combinations in Parallel |
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
JCP
2008
13 years 7 months ago
2008
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
ICANN
2011
Springer
12 years 11 months ago
2011
Springer
Subspace learning is very important in today's world of information overload. Distinguishing between categories within a subset of a large data repository such as the web and ...
PDP
2009
IEEE
14 years 2 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...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....