Search results

  1. 1.
    0504815 - ÚI 2021 RIV NL eng J - Journal Article
    Kuřátko, Jan - Ratschan, Stefan
    Solving Reachability Problems by a Scalable Constrained Optimization Method.
    Optimization and Engineering. Roč. 21, č. 1 (2020), s. 215-239. ISSN 1389-4420. E-ISSN 1573-2924
    R&D Projects: GA ČR GA15-14484S
    Institutional support: RVO:67985807
    Keywords : Optimization * Dynamical systems * Boundary value problems * Sequential quadratic programming * Reachability
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 2.760, year: 2020
    Method of publishing: Limited access
    http://dx.doi.org/10.1007/s11081-019-09441-6
    Permanent Link: http://hdl.handle.net/11104/0296371
     
     
  2. 2.
    0476164 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
    de Oliveira Oliveira, Mateus
    Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth.
    11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Guo, J.; Hermelin, D.), s. 1-12, č. článku 25. Leibniz International Proceedings in Informatics, 63. ISBN 978-3-95977-023-1. ISSN 1868-8969.
    [11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Aarhus (DK), 24.08.2016-26.08.2016]
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : linear term rewriting systems * ground reachability * ground joinability * fixed parameter tractability
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    http://drops.dagstuhl.de/opus/volltexte/2017/6925/
    Permanent Link: http://hdl.handle.net/11104/0272695
    FileDownloadSizeCommentaryVersionAccess
    DeOliveiraOliveira1.pdf3669.5 KBPublisher’s postprintrequire
     
     
  3. 3.
    0454008 - MÚ 2017 RIV CH eng C - Conference Paper (international conference)
    de Oliveira Oliveira, Mateus
    Reachability in graph transformation systems and slice languages.
    Graph Transformation. Cham: Springer, 2015 - (Parisi-Presicce, F.; Westfechtel, B.), s. 121-137. Lecture Notes in Computer Science, 9151. ISBN 978-3-319-21144-2. ISSN 0302-9743.
    [International Conference on Graph Transformation, ICGT 2015. L'Aquila (IT), 21.06.2015-23.06.2015]
    EU Projects: European Commission(XE) 339691 - FEALORA
    Institutional support: RVO:67985840
    Keywords : graph transformation systems * reachability * slice languages
    Subject RIV: BA - General Mathematics
    http://link.springer.com/chapter/10.1007%2F978-3-319-21145-9_8
    Permanent Link: http://hdl.handle.net/11104/0254722
    FileDownloadSizeCommentaryVersionAccess
    Oliveira1.pdf2391.4 KBPublisher’s postprintrequire
     
     
  4. 4.
    0336087 - MÚ 2010 RIV US eng C - Conference Paper (international conference)
    Hansen, K.A. - Koucký, Michal - Miltersen, P.B.
    Winning concurrent reachability games requires doubly-exponential patience.
    Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009. Los Angeles: IEEE Computer Society, 2009, s. 332-341. ISBN 978-0-7695-3746-7. ISSN 1043-6871.
    [24th Annual IEEE Symposium on Logic in Computer Science. Los Angeles (US), 11.08.2009-14.08.2009]
    R&D Projects: GA ČR GP201/07/P276; GA AV ČR IAA100190902; GA MŠk(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : concurrent reachability game * patience * winning strategies
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0180404
    FileDownloadSizeCommentaryVersionAccess
    Koucky1.pdf1284 KBPublisher’s postprintrequire