Search results

  1. 1.
    0405663 - UIVT-O 336045 RIV US eng J - Journal Article
    Krause, M. - Savický, Petr - Wegener, I.
    On the Influence of the Variable Ordering for Algorithmic Learning using OBDDs.
    [Vliv uspořádání proměnných na algoritmické učení pomocí OBDD.]
    Information and Computation. Roč. 201, č. 2 (2005), s. 160-177. ISSN 0890-5401. E-ISSN 1090-2651
    R&D Projects: GA ČR GA201/98/0717
    Institutional research plan: CEZ:AV0Z10300504
    Keywords : OBDD * variable ordering * algorithmic learning
    Subject RIV: BA - General Mathematics
    Impact factor: 1.053, year: 2005
    Permanent Link: http://hdl.handle.net/11104/0125803
     
     
  2. 2.
    0404707 - UIVT-O 20030012 RIV GB eng J - Journal Article
    Wiedermann, Jiří
    The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa.
    Journal of Experimental & Theoretical Artificial Intelligence. Roč. 15, č. 3 (2003), s. 267-279. ISSN 0952-813X. E-ISSN 1362-3079
    R&D Projects: GA ČR GA201/98/0717; GA ČR GA201/00/1489
    Institutional research plan: AV0Z1030915
    Keywords : computational power * neural nets * neuroids * finite automata * Turing machines
    Subject RIV: BA - General Mathematics
    Impact factor: 0.317, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0124946
     
     
  3. 3.
    0404244 - UIVT-O 20010071 RIV US eng J - Journal Article
    Savický, Petr
    On Random Orderings of Variables for Parity Ordered Binary Decision Diagrams.
    Random Structures and Algorithms. Roč. 16, č. 3 (2000), s. 233-239. ISSN 1042-9832. E-ISSN 1098-2418
    R&D Projects: GA ČR GA201/98/0717; GA MŠMT OK 304
    Grant - others:ALTEC-KIT(XE) INCO-COOP 96-0195
    Institutional research plan: AV0Z1030915
    Keywords : representation of Boolean functions * OBDD * variable ordering
    Subject RIV: BA - General Mathematics
    Impact factor: 0.568, year: 2000
    Permanent Link: http://hdl.handle.net/11104/0124508
     
     
  4. 4.
    0404104 - UIVT-O 20020142 RIV NL eng J - Journal Article
    Jukna, S. - Žák, Stanislav
    On Uncertainty versus Size in Branching Programs.
    Theoretical Computer Science. Roč. 290, - (2003), s. 1851-1867. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/98/0717; GA MŠMT LN00A056; GA ČR GA201/02/1456
    Keywords : computational complexity * branching programs * decision trees * lower bounds * kraft inequality * entropy
    Subject RIV: BA - General Mathematics
    Impact factor: 0.764, year: 2003
    Permanent Link: http://hdl.handle.net/11104/0124375
     
     
  5. 5.
    0403493 - UIVT-O 980102 RIV CZ eng J - Journal Article
    Wiedermann, Jiří
    Splendor and Misery of Parallel Machine Models.
    Neural Network World. Roč. 8, č. 3 (1998), s. 269-297. ISSN 1210-0552
    R&D Projects: GA ČR GA201/95/0976; GA ČR GA201/98/0717
    Grant - others:MŠMT(CZ) OK 304; INCO-COPERNICUS(XE) 96-0195
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0003422
     
     
  6. 6.
    0403492 - UIVT-O 20000012 RIV US eng J - Journal Article
    Wiedermann, Jiří
    Simulating the Mind: A Gauntlet Thrown to Computer Science.
    ACM Computing Surveys. Roč. 31, č. 3 (1999), Art. No. 16. ISSN 0360-0300. E-ISSN 1557-7341
    R&D Projects: GA ČR GA201/98/0717
    Grant - others:INCO-COOP(XE) 96-0195; MŠMT ČR(CZ) OK 304
    Institutional research plan: AV0Z1030915
    Subject RIV: BA - General Mathematics
    Impact factor: 1.440, year: 1999
    Permanent Link: http://hdl.handle.net/11104/0123796
     
     
  7. 7.
    0403463 - UIVT-O 20020001 RIV DE eng J - Journal Article
    Savický, Petr - Sgall, Jiří
    DNF Tautologies with a Limited Number of Occurrences of Every Variable.
    Theoretical Computer Science. Roč. 238, 1-2 (2000), s. 495-498. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/98/0717; GA AV ČR IAA1019602; GA ČR GA201/97/P038; GA MŠMT ME 103
    Institutional research plan: AV0Z1030915
    Keywords : disjunctive normal form * tautology * occurences of variable
    Subject RIV: BA - General Mathematics
    Impact factor: 0.417, year: 2000
    Permanent Link: http://hdl.handle.net/11104/0123768
     
     
  8. 8.
    0403395 - UIVT-O 20000006 RIV NL eng J - Journal Article
    Žák, Stanislav - Savický, Petr
    A Read-once Lower Bound and a (1,+k) - Hierarchy for Branching Programs.
    Theoretical Computer Science. Roč. 238, č. 1-2 (2000), s. 347-362. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GA201/98/0717
    Grant - others:MŠMT ČR(CZ) OK 304
    Institutional research plan: AV0Z1030915
    Keywords : Boolean functions * branching programs * lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.417, year: 2000
    Permanent Link: http://hdl.handle.net/11104/0123705
     
     
  9. 9.
    0403025 - UIVT-O 990003 RIV SK eng J - Journal Article
    Šíma, Jiří
    Table Rounding Problem.
    Computers and Artificial Intelligence. Roč. 18, č. 2 (1999), s. 175-189. ISSN 0232-0274
    R&D Projects: GA ČR GA201/98/0717
    Institutional research plan: AV0Z1030915
    Keywords : table * rouding * adjacent integer * check sum * maximum flow * minimum cut * minimum cost flow problem
    Subject RIV: BA - General Mathematics
    Impact factor: 0.164, year: 1999
    http://www.cai.sk/ojs/index.php/cai/article/view/606
    Permanent Link: http://hdl.handle.net/11104/0123392
    FileDownloadSizeCommentaryVersionAccess
    0403025.pdf0773.8 KBAuthor´s preprintopen-access
     
     
  10. 10.
    0402803 - UIVT-O 980004 RIV US eng J - Journal Article
    Šíma, Jiří - Wiedermann, Jiří
    Theory of Neuromata.
    Journal of the ACM. Roč. 45, č. 1 (1998), s. 155-178. ISSN 0004-5411. E-ISSN 1557-735X
    R&D Projects: GA ČR GA201/95/0976; GA ČR GA201/98/0717
    Subject RIV: BA - General Mathematics
    Impact factor: 1.703, year: 1998
    Permanent Link: http://hdl.handle.net/11104/0123179
    FileDownloadSizeCommentaryVersionAccess
    0402803.pdf0533.3 KBAuthor´s preprintopen-access
     
     


  This site uses cookies to make them easier to browse. Learn more about how we use cookies.