Results 61 to 70 of about 18,990 (308)
Noisy Tree Data Structures and Quantum Applications
Mathematics, 2023 We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy segment ...
Kamil Khadiev +3 more
doaj +1 more source
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 To appear in the proceedings of RANDOM ...
Sofya Raskhodnikova +3 more
openaire +6 more sources
Advanced Engineering Materials, EarlyView.We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
Pattern-Matching Algorithms on Indeterminate Strings [PDF]
, 2005 Title: Pattern-Matching Algorithms on Indeterminate Strings, Author: Shu Wang, Location: ThodeIn computing, strings are sequences of simple elements (letters) drawn from some alphabet.
Wang, Shu
core
Input–output maps are strongly biased towards simple outputs
Nature Communications, 2018 Algorithmic information theory measures the complexity of strings. Here the authors provide a practical bound on the probability that a randomly generated computer program produces a given output of a given complexity and apply this upper bound to RNA ...
Kamaludin Dingle +2 more
doaj +1 more source
Algorithm engineering : string processing [PDF]
, 2002 The string matching problem has attracted a lot of interest throughout the history of computer science, and is crucial to the computing industry. The theoretical community in Computer Science has a developed a rich literature in the design and analysis of string matching algorithms.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi +3 more
wiley +1 more source
RGFGA: An efficient representation and crossover for grouping genetic algorithms [PDF]
, 2005 There is substantial research into genetic algorithms that are used to group large numbers of objects into mutually exclusive subsets based upon some fitness function. However, nearly all methods involve degeneracy to some degree.
Crampton, J, Tucker, A, Swift, S
core
Efficient recovery algorithms with restricted access to strings [PDF]
, 2022 We design efficient algorithms for computational problems over strings in several models where the algorithms have limited access to the input. These models, and algorithms developed respecting these constraints, are becoming increasingly relevant due to
Sinha, Sandip
core +2 more sources
Software Library for Authorship Identification
Digital Presentation and Preservation of Cultural and Scientific Heritage, 2015 The aim of this paper is to review some methods for text authorship attribution and to discuss the development of a software library with tools for automatic authorship attribution.
Ivan Ivanov +4 more
doaj +1 more source