Search results
- 1.0375475 - ÚI 2012 RIV CZ eng C - Conference Paper (international conference)
Nedbal, Radim
Language of Preference Formulae.
SOFSEM 2012: Theory and Practice of Computer Science. Vol. 2. Prague: Institute of Computer Science AS CR, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Špánek, R.; Turán, G.), s. 75-86. ISBN 978-80-87136-13-3.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
Institutional research plan: CEZ:AV0Z10300504
Keywords : conflicting preferences * relational data model * database query
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0208118 - 2.0374354 - ÚI 2012 RIV CZ eng C - Conference Paper (international conference)
Kůrková, Věra
Accuracy Estimates for Surrogate Solutions of Integral Equations by Neural Networks.
SOFSEM 2012: Theory and Practice of Computer Science. Vol. 2. Prague: Institute of Computer Science AS CR, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Špánek, R.; Turán, G.), s. 95-102. ISBN 978-80-87136-13-3.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
R&D Projects: GA MŠMT OC10047
Institutional research plan: CEZ:AV0Z10300504
Keywords : surrogate solutions by neural networks * Fredholm integral equations * network complexity
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0207300 - 3.0368232 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Wiedermann, Jiří
Towards Computational Models of Artificial Cognitive Systems That Can, in Principle, Pass the Turing Test.
SOFSEM 2012. Theory and Practice of Computer Science. Berlin: Springer, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Turán, G.), s. 44-63. Lecture Notes in Computer Science, 7147. ISBN 978-3-642-27659-0. ISSN 0302-9743.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
R&D Projects: GA ČR GAP202/10/1333
Institutional research plan: CEZ:AV0Z10300504
Keywords : cognitive systems * Turing test * high-level architecture of an artificial agent
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0202630File Download Size Commentary Version Access a0368232.pdf 0 287.6 KB Publisher’s postprint require - 4.0364426 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří - Žák, Stanislav
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3.
SOFSEM 2012. Theory and Practice of Computer Science. Berlin: Springer, 2012 - (Bieliková, M.; Friedrich, G.; Gottlob, G.; Katzenbeisser, S.; Turán, G.), s. 406-418. Lecture Notes in Computer Science, 7147. ISBN 978-3-642-27659-0. ISSN 0302-9743.
[SOFSEM 2012. Conference on Current Trends in Theory and Practice of Computer Science /38./. Špindlerův Mlýn (CZ), 21.01.2012-27.01.2012]
R&D Projects: GA ČR GAP202/10/1333; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10300504
Keywords : derandomization * hitting set * read-once branching programs * bounded width
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0199914File Download Size Commentary Version Access a0364426.pdf 0 320.8 KB Publisher’s postprint require 0364426.pdf 1 576.4 KB Author´s preprint open-access