Sciweavers

613 search results - page 12 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 4 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
CEC
2008
IEEE
13 years 8 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
FCT
2009
Springer
14 years 1 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
DOCENG
2004
ACM
14 years 4 days ago
Supervised learning for the legacy document conversion
We consider the problem of document conversion from the renderingoriented HTML markup into a semantic-oriented XML annotation defined by user-specific DTDs or XML Schema descrip...
Boris Chidlovskii, Jérôme Fuselier
ESA
1999
Springer
89views Algorithms» more  ESA 1999»
13 years 11 months ago
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
Ting Chen, Ming-Yang Kao