Search Results - "experimental algorithms"
-
1
Improved characters distance sampling for online and offline text searching
ISSN: 0304-3975Published: Elsevier B.V 10.02.2023Published in Theoretical computer science (10.02.2023)“…Sampled string matching is a very effective technique to reduce the search time for a pattern within a text at the cost of a small amount of additional memory,…”
Get full text
Journal Article -
2
Scheduling periodic messages on a shared link without buffering
ISSN: 1094-6136, 1099-1425Published: New York Springer US 01.10.2024Published in Journal of scheduling (01.10.2024)“…Cloud RAN, a novel architecture for modern mobile networks, relocates processing units from antenna to distant data centers. This shift introduces the…”
Get full text
Journal Article -
3
Temporal betweenness centrality on shortest walks variants
ISSN: 2364-8228, 2364-8228Published: Cham Springer International Publishing 01.12.2025Published in Applied network science (01.12.2025)“…Betweenness centrality has been extensively studied since its introduction in 1977 as a measure of node importance in graphs. This measure has found use in…”
Get full text
Journal Article -
4
New Instances for Maximum Weight Independent Set From a Vehicle Routing Application
ISSN: 2662-2556, 2662-2556Published: Cham Springer International Publishing 01.12.2021Published in Operations Research Forum (01.12.2021)“…We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are…”
Get full text
Journal Article -
5
Faster Betweenness Centrality Based on Data Structure Experimentation
ISSN: 1877-0509, 1877-0509Published: Elsevier B.V 2013Published in Procedia computer science (2013)“…Betweenness centrality is a graph analytic that states the importance of a vertex based on the number of shortest paths that it is on. As such, betweenness…”
Get full text
Journal Article -
6
Fast and flexible packed string matching
ISSN: 1570-8667, 1570-8675Published: Elsevier B.V 01.09.2014Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01.09.2014)“…Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language…”
Get full text
Journal Article -
7
Hybrid string matching algorithm with a pivot
ISSN: 0165-5515, 1741-6485Published: London, England SAGE Publications 01.02.2015Published in Journal of information science (01.02.2015)“…Pattern matching is important in text processing, molecular biology, operating systems and web search engines. Many algorithms have been developed to search…”
Get full text
Journal Article -
8
Improved and self-tuned occurrence heuristics
ISSN: 1570-8667, 1570-8675Published: Elsevier B.V 01.09.2014Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01.09.2014)“…In this note we present three efficient variations of the occurrence heuristic, adopted by many exact string matching algorithms and first introduced in the…”
Get full text
Journal Article -
9
Experimental evaluation of various register-pressure-reduction heuristics
ISSN: 0038-0644, 1097-024XPublished: Bognor Regis Blackwell Publishing Ltd 01.11.2015Published in Software, practice & experience (01.11.2015)“…Summary Minimizing the amount of spill code is still an open problem in code generation and optimization. The amount of spill code depends on both the register…”
Get full text
Journal Article -
10
Distance-preserving approximations of polygonal paths
ISSN: 0925-7721Published: Elsevier B.V 01.04.2007Published in Computational geometry : theory and applications (01.04.2007)“…Given a polygonal path P with vertices p 1 , p 2 , … , p n ∈ R d and a real number t ⩾ 1 , a path Q = ( p i 1 , p i 2 , … , p i k ) is a t-distance-preserving…”
Get full text
Journal Article -
11
Scalable Algorithms for Adaptive Statistical Designs
ISSN: 1058-9244, 1875-919XPublished: 01.01.2000Published in Scientific programming (01.01.2000)“…We present a scalable, high‐performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important…”
Get full text
Journal Article -
12
Scalable Algorithms for Adaptive Statistical Designs
ISBN: 9780780398023, 0780398025ISSN: 1063-9535Published: IEEE 2000Published in ACM/IEEE SC 2000 Conference (SC'00) (2000)“…We present a scalable, high-performance solution to multidimensional recurrences that arise in adaptive statistical designs. Adaptive designs are an important…”
Get full text
Conference Proceeding -
13
New Algorithms for δγ-Order Preserving Matching
ISSN: 0121-750X, 2344-8393Published: Universidad Distrital Francisco José de Caldas 31.05.2018Published in Ingeniería (31.05.2018)“…Context: Order-preserving matching regards the relative order of strings. However, its application areas require more flexibility in the matching paradigm. We…”
Get full text
Journal Article -
14
GRASP with path-relinking for the generalized quadratic assignment problem
ISSN: 1381-1231, 1572-9397Published: Boston Springer US 01.10.2011Published in Journal of heuristics (01.10.2011)“…The generalized quadratic assignment problem (GQAP) is a generalization of the NP-hard quadratic assignment problem (QAP) that allows multiple facilities to be…”
Get full text
Journal Article -
15
Investigation into laser cladding of steel-titanium carbide powder mixtures on a steel substrate
ISSN: 1067-8212, 1934-970XPublished: Heidelberg Allerton Press 01.05.2014Published in Russian journal of non-ferrous metals (01.05.2014)“…The influence of the main parameters of laser cladding (the laser radiation power, the scanning speed of the laser beam over the treated surface, the…”
Get full text
Journal Article -
16
Strategic flexibility analysis in emergency medical service systems using decision rules
Published: IEEE 01.03.2018Published in 2018 IEEE 15th International Conference on Networking, Sensing and Control (ICNSC) (01.03.2018)“…The capacity deployment of emergency medical service systems has been studied over decades. The design problem is still challenging due to the long-term…”
Get full text
Conference Proceeding

