Results 21 to 30 of about 1,305,670 (283)
SIMULATION OF QUANTUM SEARCH ALGORITHM
Jurnal Ilmu Komputer dan Informasi, 2013 The rapid progress of computer science has been accompanied by a corresponding evolution of computation, from classical computation to quantum computation.
Rina Refianti, Achmad Benny Mutiara
doaj +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
Quantum Applications In Political Science [PDF]
, 2020 Undergraduate Research ScholarshipThis paper will show the current state of quantum computation and its application as a political science research method.
Costa, Caleb
core
Preservation and decomposition theorems for bounded degree structures [PDF]
, 2015 We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad ...
Harwath, Frederik +2 more
core +2 more sources
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
GPU accelerated maximum cardinality matching algorithms for bipartite graphs [PDF]
, 2013 We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas.
Catalyurek, Umit V. +3 more
core +5 more sources
Advancements in Computer Science: From Algorithms to AI
, 2023 Advancements in Computer Science: From Algorithms to ...
Lee Mathias, Ali Hassan
openaire +1 more source
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut [PDF]
, 2019 Approximation algorithms for constraint satisfaction problems (CSPs) are a central direction of study in theoretical computer science. In this work, we study classical product state approximation algorithms for a physically motivated quantum ...
Gharibian, Sevag, Parekh, Ojas
core +2 more sources
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
Algorithmic Thinking And Matlab In Computational Materials Science [PDF]
2006 Annual Conference & Exposition Proceedings, 2020 Comment: 13 ...
openaire +2 more sources