Search results for " Heuristics"
showing 4 items of 14 documents
Validation and Extension of the Usability Heuristics for Mobile Map Applications
2016
Heuristic usability evaluation is light but efficient method for finding usability problems. In this paper, we report the process of validation and further development of the previously introduced usability heuristics for mobile map applications. The validation began by testing the heuristics by 58 evaluators who used them for usability evaluation of four different map applications. The evaluators also filled a questionnaire about the understandability of the heuristics. The amount, severity and quality of the problems found with the heuristics were reviewed and the heuristics’ understandability analyzed. As a result, it was shown that the heuristics were efficient for finding usability pro…
Lost or not? : designing and evaluating user interfaces of mobile map services : the viewpoint of supporting users' location awareness
2016
The motivation for this thesis arose from the problem of people getting lost, both with and without mobile maps. I will answer a primary research question: 1) How can we support users’ location awareness with mobile map applications? As an ad-dition to this, I have the following sub-questions: a) Why do people get lost even when using a mobile map application? b) What are the best practices to support navigation? c) How can we research what the important objects in the natural environment are that should be emphasized in mobile maps? d) How do we prevent the user from focusing on the map service at the expense of perceiving the location in the real environment? e) What would a good mobile m…
Perfect Hashing Structures for Parallel Similarity Searches
2015
International audience; Seed-based heuristics have proved to be efficient for studying similarity between genetic databases with billions of base pairs. This paper focuses on algorithms and data structures for the filtering phase in seed-based heuristics, with an emphasis on efficient parallel GPU/manycores implementa- tion. We propose a 2-stage index structure which is based on neighborhood indexing and perfect hashing techniques. This structure performs a filtering phase over the neighborhood regions around the seeds in constant time and avoid as much as possible random memory accesses and branch divergences. Moreover, it fits particularly well on parallel SIMD processors, because it requ…
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
2006
Abstract This work deals with a dynamic dial-a-ride problem with time window constraints. In particular, new unplanned requests for service may arise at a vehicle stop and the driver must decide in real-time whether to accept or reject them. For this problem, we have developed a two-phase insertion algorithm based on route perturbations: the first phase, which is run off-line when the vehicle moves between two successive stops, aims at creating a feasible neighborhood of the current route; while the second phase, which is run in real-time every time a new request occurs, inserts, when possible, the delivery stop of the new customer in the current route.