Sciweavers

3055 search results - page 156 / 611
» Randomized Search Trees
Sort
View
GECCO
2008
Springer
140views Optimization» more  GECCO 2008»
13 years 12 months ago
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
Dirk Thierens
CORR
2008
Springer
75views Education» more  CORR 2008»
13 years 11 months ago
Soft-Input Soft-Output Sphere Decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The associated computational complexity often poses significant challenges for practical r...
Christoph Studer, Helmut Bölcskei
ICIP
2006
IEEE
14 years 4 months ago
Optimal Display Adaptation of Iconic Document Visualizations via BFOS-Style Tree Pruning
This paper introduces a new visual representation of a document or group of documents, a Dynamic Document Icon, or Dydocon. Its representation is symbolic like an icon, but change...
Kathrin Berkner, Michael J. Gormish
TCBB
2008
107views more  TCBB 2008»
13 years 10 months ago
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
CSDA
2004
77views more  CSDA 2004»
13 years 10 months ago
Variable selection bias in regression trees with constant fits
The greedy search approach to variable selection in regression trees with constant fits is considered. At each node, the method usually compares the maximally selected statistic a...
Yu-Shan Shih, Hsin-Wen Tsai