default search action
Roman Barták
- > Home > Persons > Roman Barták
Publications
- 2024
- [c154]Jakub Mestek, Roman Barták:
Multi-Agent Path Finding: Policies Instead of Plans. ICAART (1) 2024: 95-104 - 2021
- [c139]Roman Barták, Jakub Mestek:
OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots. AAAI 2021: 15991-15993 - 2018
- [c109]Jirí Kucera, Roman Barták:
LOUGA: Learning Planning Operators Using Genetic Algorithms. PKAW 2018: 124-138 - 2017
- [c102]Jan Skoda, Roman Barták:
3D Navigation for a Mobile Robot. ROBOT (2) 2017: 345-356 - 2016
- [c98]Roman Barták, Vladislav Kubon:
On Similarities Between Workflow Verification and Grammar Checking. FLAIRS 2016: 585-590 - [c91]Roman Barták, Vladislav Kubon:
Using a Grammar Checker to Validate Compliance of Processes with Workflow Models. MICAI (1) 2016: 317-331 - [c90]Roman Barták, Tomás Dvorák:
On Verification of Workflow and Planning Domain Models Using Attribute Grammars. MICAI (1) 2016: 332-345 - [c88]Jan Jelínek, Roman Barták:
Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station. PADL 2016: 3-12 - 2015
- [c85]Jan Skoda, Roman Barták:
Camera-Based Localization and Stabilization of a Flying Drone. FLAIRS 2015: 372-378 - [c82]Roman Barták, Adam Vykovsky:
Any Object Tracking and Following by a Flying Drone. MICAI (Special Sessions) 2015: 35-41 - [c81]Filip Matzner, Roman Barták:
Short-Term Motion Tracking Using Inexpensive Sensors. MICAI (2) 2015: 583-601 - 2014
- [c71]Martin Kolombo, Roman Barták:
A Constraint-Based Planner for Mars Express Orbiter. MICAI (2) 2014: 451-463 - 2012
- [c64]Andrej Chovanec, Roman Barták:
Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms. AIMSA 2012: 184-194 - 2011
- [c53]Andrej Chovanec, Roman Barták:
Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement. ICTAI 2011: 914-915 - [c52]Andrej Chovanec, Roman Barták:
On Generating Templates for Hypothesis in Inductive Logic Programming. MICAI (1) 2011: 162-173 - 2010
- [j20]Toshinori Munakata, Roman Barták:
Logic programming for combinatorial problems. Artif. Intell. Rev. 33(1-2): 135-150 (2010) - 2005
- [c22]Pavel Cejnar, Roman Barták:
Automated Search for Heuristic Functions. CP 2005: 843 - [c20]Josef Zlomek, Roman Barták:
Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. CP 2005: 876 - 2004
- [c13]Roman Barták, Radek Erben:
A New Algorithm for Singleton Arc Consistency. FLAIRS 2004: 257-262 - 2003
- [c10]Roman Barták, Roman Mecl:
Implementing Propagators for Tabular Constraints. CSCLP 2003: 44-65 - 1997
- [j1]Roman Barták, Petr Stepánek:
Extendible meta-interpreters. Kybernetika 33(3): 291-310 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint