Search results
- 1.0541869 - UIVT-O 200901 DE eng C - Conference Paper (international conference)
Savický, Petr - Wegener, I.
Efficient algorithms for the transformation between different types of binary decision diagrams.
Foundation of Software Technology and Theoretical Computer Science. Berlin: Springer, 1994 - (Brauer, W.; Hartmanis, J.; Stoler, J.), s. 390-401. Lecture Notes in Computer Science, 880. ISBN 978-3-540-58715-6.
[FSTTCS 1994 /14./. Madras (IN), 15.12.1994-19.12.1994]
Permanent Link: http://hdl.handle.net/11104/0319366 - 2.0541868 - UIVT-O 200901 DE eng C - Conference Paper (international conference)
Savický, Petr
Random Boolean formulas representing any Boolean function with asymptotically equal probability.
Mathematical Foundations of Computer Science. Berlin: Springer, 1988 - (Chytil, M.; Koubek, V.; Janiga, L.), s. 512-517. Lecture Notes in Computer Science, 324. ISBN 978-3-540-50110-7. ISSN 0302-9743.
[MFCS 1988 /13./. Karlovy Vary (CS), 29.08.1988-02.09.1988]
Permanent Link: http://hdl.handle.net/11104/0319365 - 3.0536431 - ÚI 2022 RIV US eng C - Conference Paper (international conference)
Kučera, P. - Savický, Petr
Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings.
Proceedings of the AAAI Conference on Artificial Intelligence. Palo Alto: AAAI Press, 2021, s. 3832-3840. ISBN 978-1-57735-866-4.
[AAAI 2021. Conference on Artificial Intelligence /35./. Vancouver / Online (CA), 02.02.2021-09.02.2021]
R&D Projects: GA ČR(CZ) GA19-19463S
Institutional support: RVO:67985807
Keywords : Satisfiability * Knowledge Representation Languages
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
https://ojs.aaai.org/index.php/AAAI/article/view/16501
Permanent Link: http://hdl.handle.net/11104/0314209File Download Size Commentary Version Access aaai2021.JPG 0 106.2 KB Other require 0536431-aoa.pdf 4 149.9 KB Publisher’s postprint require - 4.0480888 - ÚI 2018 DE eng C - Conference Paper (international conference)
Savický, Petr - Kučera, P.
Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. Freiburg: IJCAI, 2017 - (Sierra, C.), s. 5055-5059. ISBN 978-0-9992411-0-3.
[IJCAI 2017. International Joint Conference on Artificial Intelligence /26./. Melbourne (AU), 19.08.2017-25.08.2017]
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR GA15-15511S
Institutional support: RVO:67985807
Keywords : conjunctive normal form * matched formula * pure literal satisfiable formula
Subject RIV: BA - General Mathematics
https://www.ijcai.org/proceedings/2017/0721.pdf
Permanent Link: http://hdl.handle.net/11104/0276554File Download Size Commentary Version Access a0480888.pdf 1 104.2 KB Publisher’s postprint require - 5.0478486 - ÚI 2018 RIV CH eng C - Conference Paper (international conference)
Kučera, P. - Savický, Petr - Vorel, V.
A Lower Bound on CNF Encodings of the At-Most-One Constraint.
Theory and Applications of Satisfiability Testing - SAT 2017. Cham: Springer, 2017 - (Gaspers, S.; Walsh, T.), s. 412-428. Lecture Notes in Computer Science, 10491. ISBN 978-3-319-66262-6. ISSN 0302-9743.
[SAT 2017. International Conference on Theory and Applications of Satisfiability Testing /20./. Melbourne (AU), 28.08.2017-01.09.2017]
R&D Projects: GA ČR GBP202/12/G061
Grant - others:GA ČR(CZ) GA15-15511S
Institutional support: RVO:67985807
Keywords : Knowledge compilation * Cardinality constraint * At most one constraint * Propagation complete encoding
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0274603File Download Size Commentary Version Access 0478486.pdf 2 801.7 KB Author´s preprint open-access a0478486.pdf 4 310.6 KB Publisher’s postprint require - 6.0467765 - ÚI 2017 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří - Savický, Petr
Cut Languages in Rational Bases.
Language and Automata Theory and Applications. Cham: Springer, 2017 - (Drews, F.; Martín-Vide, C.; Truthe, B.), s. 311-322. Lecture Notes in Computer Science, 10168. ISBN 978-3-319-53732-0. ISSN 0302-9743.
[LATA 2017. International Conference on Language and Automata Theory and Applications /11./. Umea (SE), 06.03.2017-09.03.2017]
R&D Projects: GA ČR GBP202/12/G061
Institutional support: RVO:67985807
Keywords : grammars * quasi-periodic power series * cut language
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0265800File Download Size Commentary Version Access 0467765.pdf 0 787.5 KB Author´s preprint open-access a0467765.pdf 0 266.9 KB Publisher’s postprint require - 7.0405079 - UIVT-O 20030079 RIV DE eng C - Conference Paper (international conference)
Savický, Petr - Fürnkranz, J.
Combining Pairwise Classifiers with Stacking.
Advances in Intelligent Data Analysis V. Berlin: Springer, 2003 - (Berthold, M.; Lenz, H.; Bradley, E.; Kruse, R.; Borgelt, C.), s. 219-229. Lecture Notes in Computer Science, 2810. ISBN 3-540-40813-4. ISSN 0302-9743.
[IDA 2003. International Symposium on Intelligent Data Analysis /5./. Berlin (DE), 28.08.2003-30.08.2003]
R&D Projects: GA MŠMT LN00A056
Keywords : pairwise classification * multiclass problems * voting * stacking * meta-classifier
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0125293 - 8.0404881 - UIVT-O 220777 DE eng C - Conference Paper (international conference)
Savický, Petr
On Random Orderings of Variables for Parity OBDDs.
Electronic Colloquium on Computational Complexity, TR98-068. Trier, 1998
R&D Projects: GA ČR GA201/98/0717; GA MŠMT OK 304
Keywords : representation of Boolean functions * OBDD * random ordering of variables
Subject RIV: BA - General Mathematics
http://www.eccc.uni-trier.de/report/1998/068
Permanent Link: http://hdl.handle.net/11104/0125107 - 9.0404694 - UIVT-O 20020058 RIV DE eng C - Conference Paper (international conference)
Savický, Petr - Klaschka, Jan
Optimally Trained Regression Trees and Occam's Razor.
COMPSTAT 2002. Proceedings in Computational Statistics. Heidelberg: PhysicaVerlag, 2002 - (Härdle, W.; Rönz, B.), s. 479-484. ISBN 3-7908-1517-9.
[COMPSTAT 2002. Berlin (DE), 24.08.2002-28.08.2002]
R&D Projects: GA ČR GA201/00/1482
Institutional research plan: AV0Z1030915
Keywords : regression trees * recursive partitioning * optimization * dynamic programming * bottom-up algorithms * generalization * Occam's razor
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124933 - 10.0403991 - UIVT-O 20000131 RIV DE eng C - Conference Paper (international conference)
Savický, Petr - Sieling, D.
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.
Mathematical Foundations of Computer Science 2000, 25th International Symposium Proceedings. Berlin: Springer, 2000 - (Nielsen, M.; Rovan, B.), s. 650-659. Lecture Notes in Computer Science, 1893. ISBN 3-540-67901-4. ISSN 0302-9743.
[MFCS'2000. Bratislava (SK), 28.08.2000-01.09.2000]
R&D Projects: GA ČR GA201/98/0717
Institutional research plan: AV0Z1030915
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124272