Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Daniela Maftuleac"'
Publikováno v:
Computational Geometry. 89:101626
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many algorithms and p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f06c188abe413dfbae5f267762e30693
https://doi.org/10.1016/j.comgeo.2020.101626
https://doi.org/10.1016/j.comgeo.2020.101626
Autor:
James McLurkin, Sándor P. Fekete, Alejandro López-Ortiz, Daniela Maftuleac, Seoung Kyou Lee, Aditya Kumar Akash
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as the abstraction of a geometric exploration of a space by a robot, both
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9791bbbd9834046ae9ff71737b467805
http://arxiv.org/abs/1603.05944
http://arxiv.org/abs/1603.05944
Autor:
Sándor P. Fekete, Seoung Kyou Lee, Daniela Maftuleac, James McLurkin, Alejandro López-Ortiz, Aditya Kumar Akash
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783319301389
WALCOM
WALCOM
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as the abstraction of a geometric exploration of a space by a robot, both
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40f0d8ef6a1f10ae3c2b21fe1e79055
https://doi.org/10.1007/978-3-319-30139-6_5
https://doi.org/10.1007/978-3-319-30139-6_5
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319295152
IWOCA
IWOCA
In this paper, we investigate the problem of graph list colouring in the on-line setting. We provide several results on paintability of graphs in the model introduced by Schauz [18] and Zhu [25]. We prove that the on-line version of Ohba’s conjectu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edc10aaf3ca75af0f635b0dcabf6cdde
https://doi.org/10.1007/978-3-319-29516-9_11
https://doi.org/10.1007/978-3-319-29516-9_11
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783319301389
WALCOM
WALCOM
We consider the problem of multiple agents or robots searching in a coordinated fashion for a target in the plane. This is motivated by Search and Rescue operations (SAR) in the high seas which in the past were often performed with several vessels, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90cf221e4d296d1a4d848c094f1676df
https://doi.org/10.1007/978-3-319-30139-6_6
https://doi.org/10.1007/978-3-319-30139-6_6
Autor:
Aditya Kumar Akash, James McLurkin, Sándor P. Fekete, Seoung Kyou Lee, Daniela Maftuleac, Alejandro López-Ortiz
Publikováno v:
ICRA
We present and analyze methods for patrolling an environment with a distributed swarm of robots. Our approach uses a physical data structure - a distributed triangulation of the workspace. A large number of stationary "mapping" robots cover and trian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a31c8a0e46b0b72d4c916ed33318d0c
http://arxiv.org/abs/1410.2295
http://arxiv.org/abs/1410.2295
Autor:
Daniela Maftuleac
CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an algorithm for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b672b0858f42b0897b6b61c68da2fa98
http://arxiv.org/abs/1306.5796
http://arxiv.org/abs/1306.5796
Autor:
Daniela Maftuleac, Victor Chepoi
Publikováno v:
Computational Geometry
Computational Geometry, 2013, 46, pp.51-64. ⟨10.1016/j.comgeo.2012.04.002⟩
HAL
Computational Geometry, Elsevier, 2013, 46, pp.51-64
Computational Geometry, 2013, 46, pp.51-64. ⟨10.1016/j.comgeo.2012.04.002⟩
HAL
Computational Geometry, Elsevier, 2013, 46, pp.51-64
International audience; CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric space are connected by a unique shortest path gamma(x y). I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6baf44b789c34e09120dbc7ca646a67
http://arxiv.org/abs/1010.0852
http://arxiv.org/abs/1010.0852