486 search results - page 6 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
104
click to vote
EUROPAR
1999
Springer
15 years 6 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
130
click to vote
AE
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
139
Voted
SPDP
1991
IEEE
15 years 5 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
124
click to vote
ICPP
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
115
Voted
TJS
2008
15 years 1 months ago
2008
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...