Sciweavers

141 search results - page 13 / 29
» Destruction of Very Simple Trees
Sort
View
BMCBI
2008
125views more  BMCBI 2008»
14 years 11 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
ECAI
2004
Springer
15 years 5 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
JCT
2007
110views more  JCT 2007»
14 years 11 months ago
Bijective counting of Kreweras walks and loopless triangulations
Abstract. We consider lattice walks in the plane starting at the origin, remaining in the first quadrant i, j ≥ 0 and made of West, South and North-East steps. In 1965, Germain ...
Olivier Bernardi
ICPR
2004
IEEE
16 years 24 days ago
Nearest Neighbor Ensemble
Recent empirical work has shown that combining predictors can lead to significant reduction in generalization error. The individual predictors (weak learners) can be very simple, ...
Bojun Yan, Carlotta Domeniconi
EURODAC
1995
IEEE
126views VHDL» more  EURODAC 1995»
15 years 3 months ago
Timing optimization by bit-level arithmetic transformations
This paper describes a method to optimize the performance of data paths. It is based on bit-level arithmetic transformations, and is especially suited to optimize large adder stru...
Luc Rijnders, Zohair Sahraoui, Paul Six, Hugo De M...