Skip to main content

Research Repository

Advanced Search

Outputs (218)

Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization (2024)
Presentation / Conference Contribution
Champagnie, K., Arvin, F., & Hu, J. (2024, March). Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization. Presented at 2024 IEEE International Conference on Industrial Technology (ICIT), Bristol, UK

In this paper, we present GEM, a novel approach to online coverage path planning in which a swarm of homogeneous agents act to maximize the entropy of pheromone deposited within their environment. We show that entropy maximization (EM) coincides with... Read More about Decentralized Multi-Agent Coverage Path Planning with Greedy Entropy Maximization.

Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design (2024)
Presentation / Conference Contribution
Fern, N., Cristea, A. I., Nolan, S., & Stewart, C. (2024, June). Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design. Presented at 10th International Conference of the Immersive Learning Research Network, Glasgow, Scotland, UK

This doctoral colloquium paper describes a mixed-methods study to investigate the impact of high interactivity Immersive Virtual Reality (iVR) materials on learning in higher education. It is motivated by the changing landscape of iVR technology and... Read More about Doctoral Colloquium—How Interactivity and Presence Affect Learning in Immersive Virtual Reality: A Mixed Methods Study Design.

Reading CD Readers (2024)
Presentation / Conference Contribution
Bell, E. (2024, June). Reading CD Readers. Presented at Code as Conversation: Transmedia Dialogues Around Critical Code Studies, Cambridge Digital Humanities, Cambridge University

Paraphrase Generation and Identification at Paragraph-Level (2024)
Presentation / Conference Contribution
Al Saqaabi, A., Stewart, C., Akrida, E., & Cristea, A. I. (2024, June). Paraphrase Generation and Identification at Paragraph-Level. Presented at Generative Intelligence and Intelligent Tutoring Systems ITS 2024, Thessaloniki, Greece

Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities (2024)
Presentation / Conference Contribution
Pan, Z., & Cristea, A. I. (2024, June). Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities. Presented at ITS 2024: Generative Intelligence and Intelligent Tutoring Systems, Thessaloniki, Greece

Students’ success in the 21st century demands not only strong academic skills but also well-developed Non-academic Skills and Abilities (NaSAs) such as critical thinking, concentration, and emotion regulation. The emerging field of Brain-Computer Int... Read More about Towards Neuro-Enhanced Education: A Systematic Review of BCI-Assisted Development for Non-academic Skills and Abilities.

Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs (2024)
Presentation / Conference Contribution
Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S., & van Leeuwen, E. J. (2024, June). Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs. Presented at SWAT 2024, Helsinki, Finland

It is known that the weighted version of Edge Multiway Cut (also known as Multiterminal Cut) is NP-complete on planar graphs of maximum degree 3. In contrast, for the unweighted version, NP-completeness is only known for planar graphs of maximum degr... Read More about Edge Multiway Cut and Node Multiway Cut are hard for planar subcubic graphs.

Temporal Graph Realization from Fastest Paths (2024)
Presentation / Conference Contribution
Klobas, N., Mertzios, G., Molter, H., & Spirakis, P. (2024, June). Temporal Graph Realization from Fastest Paths. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, Patras, Greece

In this paper we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on periodic temporal graphs. Given an n × n matrix D and a Δ ∈ ℕ, the goal is to construct a Δ... Read More about Temporal Graph Realization from Fastest Paths.

Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization (2024)
Presentation / Conference Contribution
Erlebach, T., Morawietz, N., & Wolf, P. (2024, June). Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Patras, Greece

In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period Δ and an n× n matrix D of desired fastest travel times, and the task is to decide if there is a simple periodic temporal graph with period... Read More about Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization.