Results 21 to 30 of about 132,096,113 (307)
Фізико-математична освіта, 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
Evolutionary Computation, Optimization, and Learning Algorithms for Data Science [PDF]
, 2020 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
Constant-delay enumeration for SLP-compressed documents [PDF]
Logical Methods in Computer ScienceWe 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
A directed mutation operator for real coded genetic algorithms [PDF]
, 2010 Copyright @ Springer-Verlag Berlin Heidelberg 2010.Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper introduces a directed mutation (DM)
Yang, S +8 more
core +1 more source
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees [PDF]
Logical Methods in Computer ScienceParity 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
Algorithms and the Mathematical Foundations of Computer Science [PDF]
, 2016 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
Chaos-Based Optimization - A Review
Journal of Advanced Engineering and Computation, 2017 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
Drawings of complete multipartite graphs up to triangle flips
Journal of Computational GeometryFor a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the rotations of
Oswin Aichholzer +7 more
doaj +1 more source
Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks [PDF]
, 2010 Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc ...
Yang, S +5 more
core +1 more source
A Gentle Introduction to Computational Complexity Through an Examination of Noodle Making
Je-LKS: Journal of E-Learning and Knowledge Society, 2019 Computational complexity is regarded by many Computer Science students as extremely difficult and as a topic to be avoided. However, the concepts of an algorithm and of computational complexity as a means of characterising the resource consumption of ...
Luisa Mich, Daniel M. Berry
doaj +1 more source