Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to three million times faster than Dijkstra’s...
Daniel Delling, Peter Sanders, Dominik Schultes, D...
Abstract Previously, we have proposed two recommendation systems, the Context-aware Information Filtering (C-IF) and Context-aware Collaborative Filtering (C-CF), both of which ar...
Kenta Oku, Shinsuke Nakajima, Jun Miyazaki, Shunsu...
This paper presents a method to analyze the timing behavior of an event-based real-time protocol composition framework. The framework, called RT-Appia, allows the development and ...
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
In this paper we present our research and development experience in the context of Interactive Multimedia Documents (IMDs). We define a rich model for such documents covering the ...
Michalis Vazirgiannis, D. Tsirikos, Th. Markousis,...