Search results
- 1.0405294 - UIVT-O 330626 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří
Generating Sequential Triangle Strips by using Hopfield Nets.
[Generování sekvenčních trojúhelníkových pásů pomocí Hopfieldových sítí.]
Adaptive and Natural Computing Algorithms. Wien: Springer-Verlag, 2005 - (Ribiero, B.; Albrecht, R.; Dobnikar, A.; Pearson, D.; Steele, N.), s. 25-28. ISBN 3-211-24934-6.
[ICANNGA'2005 /7./. Coimbra (PT), 21.03.2005-23.03.2005]
R&D Projects: GA MŠMT(CZ) 1M0545; GA MŠMT LN00A056
Keywords : sequential triangle strip * combinatorial optimization * Hopfield network * minimum energy * simulated annealing
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0125474File Download Size Commentary Version Access 0405294.pdf 0 1.8 MB Author´s preprint open-access - 2.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 - 3.0404917 - UIVT-O 20030045 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.
Algorithmic Learning Theory. Berlin: Springer, 2003 - (Gavalda, R.; Jantke, K.; Takimoto, E.), s. 221-233. Lecture Notes in Artificial Intelligence, 2842. ISBN 3-540-20291-9. ISSN 0302-9743.
[ALT'2003. International Conference on Algorithmic Learning Theory /14./. Sapporo (JP), 17.10.2003-19.10.2003]
R&D Projects: GA MŠMT LN00A056
Keywords : spiking neuron * synaptic delays * loading problem * PAC learning * robust learning
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0125138File Download Size Commentary Version Access 0404917.pdf 0 387.9 KB Author´s preprint open-access - 4.0404260 - UIVT-O 20010201 RIV DE eng C - Conference Paper (international conference)
Jukna, S. - Žák, Stanislav
On Uncertainty versus Size in Branching Programs.
Electronic Colloquium on Computational Complexity. Report No.39. Trier, 2001, s. -. ISSN 1433-8092
R&D Projects: GA ČR GA201/98/0717; GA MŠMT LN00A056
Keywords : computational complexity * branching programs * decision trees * lower bounds * Kraft inequality
Subject RIV: BA - General Mathematics
http://www.eccc.uni-trier.de/report/2001/039
Permanent Link: http://hdl.handle.net/11104/0124523 - 5.0404165 - UIVT-O 20010034 RIV US eng C - Conference Paper (international conference)
Šíma, Jiří - Orponen, P.
Computing with Continuous-Time Liapunov Systems.
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. New York: ACM, 2001, s. 722-731. ISBN 1-58113-349-9.
[STOC'2001 /33./. Crete (GR), 06.07.2001-08.07.2001]
R&D Projects: GA MŠMT LN00A056
Keywords : continuous-time Hopfield nets * Liapunov systems * analog computation * Turing universality
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124432 - 6.0404164 - UIVT-O 20010033 RIV AT eng C - Conference Paper (international conference)
Šíma, Jiří
The Computational Capabilities of Neural Networks.
Artificial Neural Nets and Genetic Algorithms. Proceedings of the International conference. Wien: Springer, 2001 - (Kůrková, V.; Steele, N.; Neruda, R.; Kárný, M.), s. 22-26. ISBN 3-211-83651-9.
[ICANNGA'2001 /5./. Praha (CZ), 22.04.2001-25.04.2001]
R&D Projects: GA MŠMT LN00A056
Keywords : computational power * computational complexity * perceptrons * radial basis functions * spiking neurons * probabilistic computation * analog computation
Subject RIV: BA - General Mathematics
https://link.springer.com/book/10.1007/978-3-7091-6230-9#toc
Permanent Link: http://hdl.handle.net/11104/0124431File Download Size Commentary Version Access 0404164.pdf 3 2.5 MB Author´s preprint open-access - 7.0175345 - MU-W 20030097 RIV DE eng C - Conference Paper (international conference)
Chrobak, M. - Sgall, Jiří
Analysis of the { Harmonic } algorithm for three servers.
Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2003, s. 247-259. Lecture Notes in Computer Science., 2607.
[Annual Symposium on Theoretical Aspects of Computer Science/20./. Berlin (DE), 27.02.2003-01.03.2003]
R&D Projects: GA MŠMT LN00A056; GA ČR GA201/01/1195; GA MŠMT ME 476; GA AV ČR IAA1019901
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : online algorithms * server problem * random walk
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072329 - 8.0175344 - MU-W 20030096 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Woeginger, G. J.
A lower bound for cake cutting.
Proceedings of the 11th Annual European Symposium on Algorithms. Berlin: Springer, 2003, s. 459-469. Lecture Notes in Computer Science., 2832.
[Annual European Symposium on Algorithms/11./. Budapest (HU), 15.09.2003-20.09.2003]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901
Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905
Keywords : concrete complexity * cake-cutting * lower bound
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072328File Download Size Commentary Version Access Sgall1.pdf 1 2.4 MB Author´s preprint open-access - 9.0175226 - MU-W 20020114 RIV ES eng C - Conference Paper (international conference)
Chrobak, M. - Epstein, L. - Noga, J. - Sgall, Jiří - van Stee, R. - Tichý, Tomáš - Vakhania, N.
Preemptive scheduling in overloaded systems.
Proceedings of the 29th International Colloquium on Automata, Languages, and Programming. Berlin: SpringerVerlag, 2002, s. 800-811.
[International Colloquium on Automata, Languages, and Programming/29./. Malaga (ES), 08.07.2002-13.07.2002]
R&D Projects: GA MŠMT LN00A056; GA AV ČR IAA1019901; GA ČR GA201/01/1195; GA MŠMT ME 476
Keywords : scheduling * online algorithms * benefit
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072211 - 10.0175119 - MU-W 20025170 RIV DE eng C - Conference Paper (international conference)
Sgall, Jiří - Chrobák, M. - Csirik, J. - Imreh, C. - Noga, J. - Woeginger, G. J.
The buffer minimization problem for multiprocessor scheduling with conflicts.
Proceedings of the 28th International Colloquium on Automata, Languages, and Programming. Berlin: SpringerVerlag, 2001, s. 862-874.
[International Colloquium on Automata, Languages, and Programming/28./. Crete (GR), 08.07.2001-12.07.2001]
R&D Projects: GA AV ČR IAA1019901; GA ČR GA201/97/P038; GA MŠMT LN00A056
Keywords : online algorithms%scheduling%conflict graph
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0072108