Zobrazeno 1 - 10
of 1 312
pro vyhledávání: '"van Renssen A"'
We consider the problem of computing an approximate weighted shortest path in a weighted subdivision, with weights assigned from the set $\{0, 1, \infty\}$. We present a data structure $B$, which stores a set of convex, non-overlapping regions. These
Externí odkaz:
http://arxiv.org/abs/2407.01951
Autor:
Hoondert, Martin
Publikováno v:
Tijdschrift over Cultuur & Criminaliteit, 12(1), 42-57
On July 8, 2009, a monument for ex-Dutchbat soldier Raviv van Renssen was unveiled in Srebrenica, Bosnia-Herzegovina. This monument is the focus of this article. What are the symbolic functions of this monument and what role does this commemorative p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::999d55c82d749248e9f3adb8cc98499f
https://doi.org/10.5553/tcc/221195072022012001003
https://doi.org/10.5553/tcc/221195072022012001003
Autor:
van Renssen, André
In this paper, we describe how we changed the structure of problem sessions in an algorithmic subject, in order to improve student confidence. The subject in question is taught to very large cohorts of (around 900) students, though our approach can b
Externí odkaz:
http://arxiv.org/abs/2311.12365
Publikováno v:
Tijdschrift over Cultuur & Criminaliteit. 12(1):42-57
On July 8, 2009, a monument for ex-Dutchbat soldier Raviv van Renssen was unveiled in Srebrenica, Bosnia-Herzegovina. This monument is the focus of this article. What are the symbolic functions of this monument and what role does this commemorative p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::dd6d98aac16e0123844fc33d9aef267c
Publikováno v:
Tijdschrift over Cultuur & Criminaliteit. 12(1):42-57
On July 8, 2009, a monument for ex-Dutchbat soldier Raviv van Renssen was unveiled in Srebrenica, Bosnia-Herzegovina. This monument is the focus of this article. What are the symbolic functions of this monument and what role does this commemorative p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___01181::09a20bf34904dbd2c3640363e315417b
https://research.tilburguniversity.edu/en/publications/ce3efa6b-79df-4056-83c9-0a67e68d064f
https://research.tilburguniversity.edu/en/publications/ce3efa6b-79df-4056-83c9-0a67e68d064f
Given a set of $n$ point robots inside a simple polygon $P$, the task is to move the robots from their starting positions to their target positions along their shortest paths, while the mutual visibility of these robots is preserved. Previous work on
Externí odkaz:
http://arxiv.org/abs/2309.16901
Given a set of $n\geq 1$ autonomous, anonymous, indistinguishable, silent, and possibly disoriented mobile unit disk (i.e., fat) robots operating following Look-Compute-Move cycles in the Euclidean plane, we consider the Pattern Formation problem: fr
Externí odkaz:
http://arxiv.org/abs/2309.14649
We present a near-linear time approximation algorithm for the subtrajectory cluster problem of $c$-packed trajectories. The problem involves finding $m$ subtrajectories within a given trajectory $T$ such that their Fr\'echet distances are at most $(1
Externí odkaz:
http://arxiv.org/abs/2307.10610
Autor:
Buchin, Kevin, Gudmundsson, Joachim, Kalb, Antonia, Popov, Aleksandr, Rehs, Carolin, van Renssen, André, Wong, Sampson
Given a point set $P$ in the Euclidean plane and a parameter $t$, we define an \emph{oriented $t$-spanner} $G$ as an oriented subgraph of the complete bi-directed graph such that for every pair of points, the shortest closed walk in $G$ through those
Externí odkaz:
http://arxiv.org/abs/2306.17097
Given a set of $n\geq 1$ unit disk robots in the Euclidean plane, we consider the Pattern Formation problem, i.e., the robots must reposition themselves to form a given target pattern. This problem arises under obstructed visibility, where a robot ca
Externí odkaz:
http://arxiv.org/abs/2306.14440