Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Radu Mariescu-Istodor"'
Publikováno v:
BMC Health Services Research, Vol 23, Iss 1, Pp 1-15 (2023)
Abstract Background To reduce risk of death in acute ST-segment elevation myocardial infraction (STEMI), patients must reach a percutaneous coronary intervention (PCI) within 120 min from the start of symptoms. Current hospital locations represent ch
Externí odkaz:
https://doaj.org/article/4e2b49b2e70d4216a5b01ef82c5d21aa
Publikováno v:
Proceedings of the XXth Conference of Open Innovations Association FRUCT, Vol 29, Iss 1, Pp 109-117 (2021)
Location-based games have been around since 2000. In these games, players are required to move and interact with objects in the physical world. Players need to reach a set of targets by moving outdoors. The targets are real objects (amenities) like s
Externí odkaz:
https://doaj.org/article/534aa640371b40a085fec643cdef9db1
Autor:
Radu Mariescu-Istodor, Pasi Fränti
Publikováno v:
Frontiers in Robotics and AI, Vol 8 (2021)
The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solv
Externí odkaz:
https://doaj.org/article/e88e3b050dc8477999b230c8efa82fbf
Publikováno v:
ISPRS International Journal of Geo-Information, Vol 11, Iss 2, p 133 (2022)
Averaging GPS trajectories is needed in applications such as clustering and automatic extraction of road segments. Calculating mean for trajectories and other time series data is non-trivial and shown to be an NP-hard problem. medoid has therefore be
Externí odkaz:
https://doaj.org/article/cc9fa0071c534682a2e12a19b058915a
Publikováno v:
Applied Sciences, Vol 9, Iss 22, p 4899 (2019)
Extracting road segments by averaging GPS trajectories is very challenging. Most existing averaging strategies suffer from high complexity, poor accuracy, or both. For example, finding the optimal mean for a set of sequences is known to be NP-hard, w
Externí odkaz:
https://doaj.org/article/e7b11473f269414683e5afe7797267e7
Publikováno v:
Applied Sciences, Vol 9, Iss 19, p 3985 (2019)
The traveling salesman problem (TSP) has been widely studied for the classical closed-loop variant. However, very little attention has been paid to the open-loop variant. Most of the existing studies also focus merely on presenting the overall optimi
Externí odkaz:
https://doaj.org/article/3a103be06bf141e6a2ff8c186511601b
Autor:
Pasi Fränti, Radu Mariescu-Istodor
Publikováno v:
Pattern Recognition Letters. 167:115-121
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf567ecf85ef79cd1de416b5e800df68
https://doi.org/10.1016/j.patrec.2023.02.005
https://doi.org/10.1016/j.patrec.2023.02.005
Publikováno v:
Procedia Computer Science. 219:1120-1127
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4ed555be3c8c4013db9e4ae6c9615b0
https://doi.org/10.1016/j.procs.2023.01.392
https://doi.org/10.1016/j.procs.2023.01.392
Publikováno v:
ACM Transactions on Spatial Algorithms and Systems. 7:1-41
The Vehicle Routing Problem (VRP) is an NP hard problem where we need to optimize itineraries for agents to visit multiple targets. When considering real-world travel (road-network topology, speed limits and traffic), modern VRP solvers can only proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::482069f3030729fcfc4945936ed84f73
https://doi.org/10.1145/3474832
https://doi.org/10.1145/3474832
Publikováno v:
Proceedings of the XXth Conference of Open Innovations Association FRUCT, Vol 29, Iss 1, Pp 109-117 (2021)
FRUCT
FRUCT
Location-based games have been around since 2000. In these games, players are required to move and interact with objects in the physical world. Players need to reach a set of targets by moving outdoors. The targets are real objects (amenities) like s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eacb1ce7e2b0f8c3933c3388e09306e9
https://www.fruct.org/publications/fruct29/files/Faz.pdf
https://www.fruct.org/publications/fruct29/files/Faz.pdf