Search Results - "experimental algorithms"

  • Showing 1 - 16 results of 16
Refine Results
  1. 1

    Improved characters distance sampling for online and offline text searching by Faro, Simone, Marino, Francesco Pio, Pavone, Arianna

    ISSN: 0304-3975
    Published: Elsevier B.V 10.02.2023
    Published 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. 2

    Scheduling periodic messages on a shared link without buffering by Guiraud, Maël, Strozecki, Yann

    ISSN: 1094-6136, 1099-1425
    Published: New York Springer US 01.10.2024
    Published 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. 3

    Temporal betweenness centrality on shortest walks variants by Naima, Mehdi

    ISSN: 2364-8228, 2364-8228
    Published: Cham Springer International Publishing 01.12.2025
    Published 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. 4

    New Instances for Maximum Weight Independent Set From a Vehicle Routing Application by Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico

    ISSN: 2662-2556, 2662-2556
    Published: Cham Springer International Publishing 01.12.2021
    Published 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. 5

    Faster Betweenness Centrality Based on Data Structure Experimentation by Green, Oded, Bader, David A.

    ISSN: 1877-0509, 1877-0509
    Published: Elsevier B.V 2013
    Published 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. 6

    Fast and flexible packed string matching by Faro, Simone, Külekci, M. Oğuzhan

    ISSN: 1570-8667, 1570-8675
    Published: Elsevier B.V 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. 7

    Hybrid string matching algorithm with a pivot by Al-Ssulami, Abdulrakeeb M.

    ISSN: 0165-5515, 1741-6485
    Published: London, England SAGE Publications 01.02.2015
    Published 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. 8

    Improved and self-tuned occurrence heuristics by Cantone, Domenico, Faro, Simone

    ISSN: 1570-8667, 1570-8675
    Published: Elsevier B.V 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. 9

    Experimental evaluation of various register-pressure-reduction heuristics by Shobaki, Ghassan, Sakka, Laith, Abu Rmaileh, Najm Eldeen, Al-Hamash, Hasan

    ISSN: 0038-0644, 1097-024X
    Published: Bognor Regis Blackwell Publishing Ltd 01.11.2015
    Published 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. 10

    Distance-preserving approximations of polygonal paths by Gudmundsson, Joachim, Narasimhan, Giri, Smid, Michiel

    ISSN: 0925-7721
    Published: Elsevier B.V 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. 11

    Scalable Algorithms for Adaptive Statistical Designs by Oehmke, Robert, Hardwick, Janis, Stout, Quentin F.

    ISSN: 1058-9244, 1875-919X
    Published: 01.01.2000
    Published 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. 12

    Scalable Algorithms for Adaptive Statistical Designs by Oehmke, R., Hardwick, J., Stout, Q.F.

    ISBN: 9780780398023, 0780398025
    ISSN: 1063-9535
    Published: IEEE 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. 13

    New Algorithms for δγ-Order Preserving Matching by Mendivelso, Juan, Niquefa, Rafael, Pinzón, Yoan, Hernández, Germán

    ISSN: 0121-750X, 2344-8393
    Published: Universidad Distrital Francisco José de Caldas 31.05.2018
    Published 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. 14

    GRASP with path-relinking for the generalized quadratic assignment problem by Mateus, Geraldo R., Resende, Mauricio G. C., Silva, Ricardo M. A.

    ISSN: 1381-1231, 1572-9397
    Published: Boston Springer US 01.10.2011
    Published 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. 15

    Investigation into laser cladding of steel-titanium carbide powder mixtures on a steel substrate by Narva, V. K., Marants, A. V., Sentyurina, Zh. A.

    ISSN: 1067-8212, 1934-970X
    Published: Heidelberg Allerton Press 01.05.2014
    Published 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. 16

    Strategic flexibility analysis in emergency medical service systems using decision rules by Zhou, Yuan, Cardin, Michel-Alexandre, Zhang, Sizhe

    Published: IEEE 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