Sciweavers

100 search results - page 2 / 20
» Optimising Graph Partitions Using Parallel Evolution
Sort
View
ANOR
2004
68views more  ANOR 2004»
13 years 7 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
EUROPAR
1998
Springer
13 years 11 months ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
ACSC
2005
IEEE
14 years 1 months ago
Graph Grammar Encoding and Evolution of Automata Networks
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
Martin H. Luerssen
PAMI
2006
226views more  PAMI 2006»
13 years 7 months ago
Graph Partitioning Active Contours (GPAC) for Image Segmentation
In this paper we introduce new type of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of t...
Baris Sumengen, B. S. Manjunath
PADS
2004
ACM
14 years 1 months ago
Exploiting Symmetry for Partitioning Models in Parallel Discrete Event Simulation
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
Jan Lemeire, Bart Smets, Philippe Cara, Erik F. Di...