Sciweavers

344 search results - page 55 / 69
» The Directed Minimum Latency Problem
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
GECCO
2004
Springer
15 years 2 months ago
Three Evolutionary Codings of Rectilinear Steiner Arborescences
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. Th...
Bryant A. Julstrom, Athos Antoniades
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 2 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
GECCO
2008
Springer
274views Optimization» more  GECCO 2008»
14 years 10 months ago
Bacterial foraging oriented by particle swarm optimization strategy for PID tuning
Proportional integral derivative (PID) controller tuning is an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm...
Wael Mansour Korani
PAMI
2006
181views more  PAMI 2006»
14 years 9 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka