Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Ivanová, Marika"'
Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources
Externí odkaz:
http://arxiv.org/abs/2107.06359
We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. The problem consists of two adversarial teams of agents that move in an undirec
Externí odkaz:
http://arxiv.org/abs/1709.01070
Autor:
Ivanová, Marika, Surynek, Pavel
We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most
Externí odkaz:
http://arxiv.org/abs/1708.07285
Autor:
Ivanová, Marika
Presented master thesis defines and investigates Adversarial Cooperative Path-finding problem (ACPF), a generalization of standard Cooperative Path-finding. In addition to the Cooperative path- finding where non-colliding paths for multiple agents co
Externí odkaz:
http://www.nusl.cz/ntk/nusl-335127
Autor:
Ivana, Pavol, Ivanova, Marika
In this article, we present the result of the research, which was directed to gaining electromotive voltage in a theoretically pure way. We designed and built a brushless generator that simulates a homogenised magnetic field and should theoretically
Externí odkaz:
http://arxiv.org/abs/1601.07750
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ivanova, Marika
Publikováno v:
In Electronic Notes in Discrete Mathematics November 2016 55:5-8
Autor:
Ivanová, Marika
The primary objective of this thesis is to study and summarize the current algorithms used in computer chess and their subsequent implementation. The thesis includes a program that in addition to regular single-player game of chess against the comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::511c0c66718ac86d353cfc5923b539d0
http://www.nusl.cz/ntk/nusl-490522
http://www.nusl.cz/ntk/nusl-490522
Autor:
Mintál, Samuel
In reality agents do not always execute their plans perfectly. Due to various reasons that are not foreseeable by the plans, agents tend to deviate from the assigned plans over time. These inaccuracies in execution can result from ordinary delays to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2186::87f83ab449133bed6981ffe7f3f97344
http://www.nusl.cz/ntk/nusl-452475
http://www.nusl.cz/ntk/nusl-452475