Results 11 to 20 of about 216,770 (264)
Dynamic partitioning of search patterns for approximate pattern matching using search schemes
iScience, 2021 Summary: Search schemes constitute a flexible and generic framework to describe how all approximate occurrences of a search pattern in a text can be found efficiently.
Luca Renders +2 more
doaj +1 more source
Improved Algorithms for Parity and Streett objectives [PDF]
Logical Methods in Computer Science, 2017 The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness ...
Krishnendu Chatterjee +2 more
doaj +1 more source
Representations of Stream Processors Using Nested Fixed Points [PDF]
Logical Methods in Computer Science, 2009 We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions.
Neil Ghani +2 more
doaj +1 more source
Preface to the Special Issue on “Mathematical Methods for Computer Science”
Mathematics, 2023 In the last few decades, the relationship between mathematics and algorithms has become increasingly important and influential in computer science [...]
Zhongyun Hua, Yushu Zhang
doaj +1 more source
Computer science: Algorithmic rapture [PDF]
Nature, 2012 Philip Ball listens in on an album of evolved music composed by the Darwinian computer program Iamus.
openaire +1 more source
Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue)
Algorithms, 2023 This is a Special Issue of the open-access journal Algorithms consisting of surveys in theoretical computer science [...]
Jesper Jansson
doaj +1 more source
Fine-grained Meta-Theorems for Vertex Integrity [PDF]
Logical Methods in Computer ScienceVertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj +1 more source
Analysis of H-index and Papers Citation in Computer Science Field using K-Means Clustering Algorithm
Iraqi Journal for Computer Science and Mathematics, 2023 This paper provides an analysis of H-index and paper citations in the computer science field using K-Means Clustering Algorithm. By leveraging cutting edge visual analytics through the use of Power BI and Orange Data Mining tool with K-Means clustering ...
Omar Ibrahim Obaid
doaj +1 more source
Zygon, 2022 The effectiveness of evolutionary algorithms is one of the issues discussed in The Compatibility of Evolution and Design, where it is argued that such algorithms are only effective when stringent preconditions are met.
doaj +2 more sources
Фізико-математична освіта, 2021 Relevance and expediency of introduction of a training course of computer mathematics for students of “Secondary Education (Computer Science)” is caused by necessity of use of computer equipment with the corresponding software almost in all areas of ...
Варвара Черненко
doaj +1 more source