Search Results - "Algorithm engineering"

On Finding Optimal (Dynamic) Arborescences by Espada, Joaquim, Francisco, Alexandre P., Rocher, Tatiana, Russo, Luís M. S., Vaz, Cátia

“…, an optimal arborescence. Furthermore, when G is subject to changes, namely, edge insertions and deletions, we are interested in efficiently maintaining a dynamic arborescence in G…”
Get full text

Energy-Optimal Routes for Battery Electric Vehicles by Baum, Moritz, Dibbelt, Julian, Pajor, Thomas, Sauer, Jonas, Wagner, Dorothea, Zündorf, Tobias

“… These restrictions can be captured by profiles , which are a functional representation of optimal energy consumption between two locations, subject to initial state of charge…”
Get full text

Histone Modification ChIP-Seq Algorithm Engineering and High Performance Bioinformatics Graphics and Analysis Software for Computational Epigenetics by Khomtchouk, Bohdan Bohdanovich

“…Novel algorithm design, implementation, and optimization in histone modification ChIP-seq analysis of broad chromatin mark data is the subject of part I of this dissertation, focusing on data-driven…”
Get full text

Fully dynamic update of arc-flags by D'Angelo, Gianlorenzo, D'Emidio, Mattia, Frigioni, Daniele

“…Best connections in real networks are usually found by applying Dijkstra's shortest paths algorithm. Unfortunately, networks deriving from real‐world…”
Get full text

On Design and Implementation of a Generic Number Type for Real Algebraic Number Computations Based on Expression Dags by Mörig, Marc, Rössling, Ivo, Schirra, Stefan

“… . The sign computation is always correct and, in this sense, not subject to rounding errors…”
Get full text

HeartID: A Multiresolution Convolutional Neural Network for ECG-Based Biometric Human Identification in Smart Health Applications by Zhang, Qingxue, Zhou, Dian, Zeng, Xuan

“…Body area networks, including smart sensors, are widely reshaping health applications in the new era of smart cities. To meet increasing security and privacy…”
Get full text

Journey Planning Algorithms for Massive Delay-Prone Transit Networks by D’Emidio, Mattia, Khan, Imran, Frigioni, Daniele

“…This paper studies the journey planning problem in the context of transit networks. Given the timetable of a schedule-based transportation system (consisting,…”
Get full text

Efficient Algorithms for Road Networks and Noisy Sorting: An Experimental and Theoretical Perspective by Ozel, Evrim

“…Experimental algorithmics, also referred to as algorithm engineering, is the principled approach of using empirical methods to complement traditional theoretical methods, both of which…”
Get full text

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study by Hanauer, Kathrin, Henzinger, Monika, Schulz, Christian

“…Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions…”
Get full text

Enhance the Understanding of Whole-Genome Evolution by Designing, Accelerating and Parallelizing Phylogenetic Algorithms by Yin, Zhaoming

“… arrangements are subject to change. Phylogeneticanalysis has became essential to research on the evolutionary tree of life…”
Get full text