Results 21 to 30 of about 272,600 (304)
Fine-grained Meta-Theorems for Vertex Integrity [PDF]
Vertex 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
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
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
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
Evolutionary Computation, Optimization, and Learning Algorithms for Data Science [PDF]
A large number of engineering, science and computational problems have yet to be solved in a computationally efficient way. One of the emerging challenges is how evolving technologies grow towards autonomy and intelligent decision making. This leads to collection of large amounts of data from various sensing and measurement technologies, e.g., cameras,
Mohammadi, Farid Ghareh +2 more
openaire +2 more sources
Beginners in Computer Science Studies
Computer Science is a dynamic and interdisciplinary field that encompasses the study of algorithms, data structures, programming languages, and computational theory, with applications spanning across virtually all domains of modern life.
Dr. Ignatious Herman +2 more
core +1 more source
Constant-delay enumeration for SLP-compressed documents [PDF]
We study the problem of enumerating results from a query over a compressed document. The model we use for compression are straight-line programs (SLPs), which are defined by a context-free grammar that produces a single string.
Martín Muñoz, Cristian Riveros
doaj +1 more source
Algorithms and the Mathematical Foundations of Computer Science [PDF]
The goal of this chapter is to bring to the attention of philosophers of mathematics the concept of algorithm as it is studied incontemporary theoretical computer science, and at the same time address several foundational questions about the role this notion plays in our practices.
openaire +1 more source
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees [PDF]
Parity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (STOC 2017). The combinatorial object underlying these approaches is a universal tree, as identified by Czerwiński et al. (SODA 2019).
Zhuan Khye Koh, Georg Loho
doaj +1 more source
Chaos-Based Optimization - A Review
This paper discusses the utilization of the complex chaotic dynamics given by the selected time-continuous chaotic systems as well as by the discrete chaotic maps, as the chaotic pseudo-random number generators and driving maps for the chaos based ...
Roman Senkerik +2 more
doaj +1 more source

