Sciweavers

983 search results - page 38 / 197
» Negative-Weight Cycle Algorithms
Sort
View
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 8 months ago
Evolutionary change in developmental timing
This paper presents a mutation-based evolutionary algorithm that evolves genotypic genes for regulating developmental timing of phenotypic values. The genotype sequentially genera...
Kei Ohnishi, Kaori Yoshida
PDCAT
2007
Springer
15 years 9 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
15 years 9 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...
JCT
2010
112views more  JCT 2010»
15 years 1 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
PRL
2008
135views more  PRL 2008»
15 years 3 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa