Sciweavers

1159 search results - page 49 / 232
» Binary Decision Graphs
Sort
View
COMSIS
2006
156views more  COMSIS 2006»
13 years 9 months ago
A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Kristína Machova, Miroslav Puszta, Frantise...
FSTTCS
2005
Springer
14 years 2 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
ISMVL
2003
IEEE
80views Hardware» more  ISMVL 2003»
14 years 2 months ago
Augmented Sifting of Multiple-Valued Decision Diagrams
Discrete functions are now commonly represented by binary (BDD) and multiple-valued (MDD) decision diagrams. Sifting is an effective heuristic technique which applies adjacent var...
D. Michael Miller, Rolf Drechsler
DAM
2006
113views more  DAM 2006»
13 years 9 months ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
AMAI
2005
Springer
13 years 9 months ago
Toward leaner binary-clause reasoning in a satisfiability solver
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that o...
Allen Van Gelder