Results 21 to 30 of about 2,774 (93)
RuntimeSearch: Ctrl+F for a Running Program
, 2017 Developers often try to find occurrences of a certain term in a software system. Traditionally, a text search is limited to static source code files. In this paper, we introduce a simple approach, RuntimeSearch, where the given term is searched in the ...
Porubän, Jaroslav, Sulír, Matúš
core +1 more source
Equal-Subset-Sum Faster Than the Meet-in-the-Middle [PDF]
, 2019 In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if there exist two disjoint nonempty subsets A,B subseteq S, whose elements sum up to the same value. The problem is NP-complete.
Mucha, Marcin +3 more
core +5 more sources
A Quantitative Study of Java Software Buildability
, 2017 Researchers, students and practitioners often encounter a situation when the build process of a third-party software system fails. In this paper, we aim to confirm this observation present mainly as anecdotal evidence so far.
Beller M. +4 more
core +1 more source
Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper) [PDF]
, 2017 One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip (ONoCs). Among them, wavelength routing can be used to route
Bertozzi, Davide +3 more
core +2 more sources
OASIcs, Volume 95, FMBC 2021, Complete Volume
, 2021 OASIcs, Volume 95, FMBC 2021, Complete ...
Bernardo, Bruno, Marmsoler, Diego
openaire +2 more sources
Compressed Transmission of Route Descriptions [PDF]
, 2010 We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges.
Batz, Gernot Veit +3 more
core
OASIcs, Volume 114, WCET 2023, Complete Volume
, 2023 OASIcs, Volume 114, WCET 2023, Complete ...
openaire +2 more sources
OASIcs, Volume 93, LDK 2021, Complete Volume
, 2021 OASIcs, Volume 93, LDK 2021, Complete ...
Gromann, Dagmar +7 more
openaire +2 more sources
Oriented coloring on recursively defined digraphs
, 2019 Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank +2 more
core +1 more source
Path Finding Strategies in Stochastic Networks [PDF]
, 2014 We introduce a novel generic algorithmic problem in directed acyclic graphs, motivated by our train delay research. Roughly speaking, an arc is admissible or not subject to the value of a random variable at its tail node.
Keyhani, Mohammad Hossein +2 more
core