Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Jaco Geldenhuys"'
Publikováno v:
Journal of Universal Computer Science, Vol 29, Iss 2, Pp 100-117 (2023)
A bordered box repetition-free word is a finite word w where any given factor of the form asa, with a ∈ Σ and s ∈ Σ∗, occurs at most once. Four existing search algorithms are adapted to search for long bordered box repetition-free words over
Externí odkaz:
https://doaj.org/article/c8ab3f0e2aad45a4b20951da5e126a91
Autor:
Jaco Geldenhuys, Brink van der Merwe
Publikováno v:
South African Computer Journal, Vol 0, Iss 44 (2010)
We consider two ways of inserting a key into a binary search tree: leaf insertion which is the standard method, and root insertion which involves additional rotations. Although the respective cost of constructing leaf and root insertion binary sear
Externí odkaz:
https://doaj.org/article/085b9eeb050e48b2a819a9c45980af4f
Publikováno v:
Journal of Informetrics. 13:270-290
We evaluate article-level metrics along two dimensions. Firstly, we analyse metrics’ ranking bias in terms of fields and time. Secondly, we evaluate their performance based on test data that consists of (1) papers that have won high-impact awards a
Publikováno v:
Journal of Informetrics. 13:299-313
We analyse the difference between the averaged (average of ratios) and globalised (ratio of averages) author-level aggregation approaches based on various paper-level metrics. We evaluate the aggregation variants in terms of (1) their field bias on t
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030557539
NFM
NFM
Satisfiability Modulo Theories (SMT) solvers play a major role in the success of symbolic execution as program analysis technique. However, often they are still the main performance bottleneck. One approach to improve SMT performance is to use cachin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fc2c3d1c1c144dfc19b5ad37d06535f
https://doi.org/10.1007/978-3-030-55754-6_15
https://doi.org/10.1007/978-3-030-55754-6_15
Autor:
Jaco Geldenhuys, Willem Visser
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030452360
TACAS (2)
TACAS (2)
COASTAL is a program analysis tool for Java programs. It combines concolic execution and fuzz testing in a framework with built-in concurrency, allowing the two approaches to cooperate naturally.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be53de5e7113ebf39a98bf919d89d1d9
https://doi.org/10.1007/978-3-030-45237-7_23
https://doi.org/10.1007/978-3-030-45237-7_23
Publikováno v:
Journal of Informetrics. 12:631-655
In the field of scientometrics, impact indicators and ranking algorithms are frequently evaluated using unlabelled test data comprising relevant entities (e.g., papers, authors, or institutions) that are considered important. The rationale is that th
Publikováno v:
Journal of Informetrics. 12:679-702
We evaluate author impact indicators and ranking algorithms on two publication databases using large test data sets of well-established researchers. The test data consists of (1) ACM fellowship and (2) various life-time achievement awards. We also ev
Publikováno v:
Journal of Informetrics. 10:392-407
In the work presented in this paper, we analyse ranking algorithms that can be applied to bibliographic citation networks and rank academic entities such as papers and authors. We evaluate how well these algorithms identify important and high-impact
Publikováno v:
Theoretical Computer Science. 537:97-104
Okhotin showed an exponential trade-off in the conversion from nondeterministic unary automata to unambiguous nondeterministic unary automata. We show that the trade-off in the case of unary symmetric difference automata to finitely (structurally) am