Sciweavers

365 search results - page 21 / 73
» On the Crossing Spanning Tree Problem
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
ISMIR
2005
Springer
152views Music» more  ISMIR 2005»
14 years 2 months ago
ATTA: Automatic Time-Span Tree Analyzer Based on Extended GTTM
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
Masatoshi Hamanaka, Keiji Hirata, Satoshi Tojo
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 2 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
PDCAT
2005
Springer
14 years 2 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...