( en | de | ru )

 

Disambiguation of "Savický, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Combining Pairwise Classifiers with Stacking.

, and . IDA, volume 2810 of Lecture Notes in Computer Science, page 219-229. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jan Savicky

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

 

Other publications of authors with the same name

Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract)., and . IJCAI, page 5055-5059. ijcai.org, (2017)Cut Languages in Rational Bases., and . LATA, volume 10168 of Lecture Notes in Computer Science, page 311-322. (2017)Propagation complete encodings of smooth DNNF theories., and . Constraints An Int. J., 27 (3): 327-359 (2022)Bounds on the Size of PC and URC Formulas., and . J. Artif. Intell. Res., (2020)Softening Splits in Decision Trees Using Simulated Annealing., and . ICANNGA (1), volume 4431 of Lecture Notes in Computer Science, page 721-729. Springer, (2007)Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams., and . FSTTCS, volume 880 of Lecture Notes in Computer Science, page 390-401. Springer, (1994)On Sparse Parity Chack Matrices (Extended Abstract)., , and . COCOON, volume 1090 of Lecture Notes in Computer Science, page 41-49. Springer, (1996)Generating models of a matched formula with a polynomial delay., and . ISAIM, (2016)Some Typical Properties of Large AND/OR Boolean Formulas., and . MFCS, volume 969 of Lecture Notes in Computer Science, page 237-246. Springer, (1995)A Hierarchy for (1, +k)-Branching Programs with Respect of k., and . MFCS, volume 1295 of Lecture Notes in Computer Science, page 478-487. Springer, (1997)