Sciweavers

188 search results - page 31 / 38
» A new meta-method for graph partitioning
Sort
View
FDL
2004
IEEE
13 years 11 months ago
On Actors and Objects - OOP in System Level Design
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
Joachim K. Anlauf, Philipp A. Hartmann
SPDP
1991
IEEE
13 years 11 months ago
Asynchronous parallel search by the parallel genetic algorithm
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...
Heinz Mühlenbein
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 1 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
COMPGEOM
2004
ACM
14 years 1 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
PRL
2006
117views more  PRL 2006»
13 years 7 months ago
Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is...
Abraham Duarte, Miguel Ángel Sánchez...