Results 1 to 10 of about 272,600 (304)
Gamifying Computer Science Education for Z Generation
Information, 2021 Generation Z members use their smart devices as part of their everyday routine. Teaching methods may need to be updated to make learning materials more interesting for this generation.
Hadeel Mohammed Jawad, Samir Tout
doaj +3 more sources
Verified Approximation Algorithms [PDF]
Logical Methods in Computer Science, 2022 We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing.
Robin Eßmann +3 more
doaj +1 more source
Machine Learning Optimization Algorithms for Clustering Regions and Emergency Management: A Review [PDF]
Journal of Multidisciplinary HealthcareSampson Akwafuo,1 Prachi Fnu,2 Daniel Quezada1 1Department of Computer Science, California State University, Fullerton, CA, USA; 2Department of Computer Engineering, California State University, Fullerton, CA, USACorrespondence: Sampson Akwafuo ...
Akwafuo S, Fnu P, Quezada D
doaj +2 more sources
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Efficient and Modular Coalgebraic Partition Refinement [PDF]
Logical Methods in Computer Science, 2020 We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification.
Thorsten Wißmann +3 more
doaj +1 more source
Numerical algorithms for high-performance computational science [PDF]
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2020 A number of features of today’s high-performance computers make it challenging to exploit these machines fully for computational science. These include increasing core counts but stagnant clock frequencies; the high cost of data movement; use of accelerators (GPUs, FPGAs, coprocessors), making architectures increasingly heterogeneous; and multi- ple ...
Dongarra, Jack +2 more
openaire +5 more sources
International Journal of Computational Intelligence Systems, 2023 Opinion mining or sentiment analysis (SA) is a key component of real-world applications for e-commerce organizations, manufacturers, and customers. SA deals with the computational evaluation of people’s views, thoughts, and feelings in the text, whether ...
Halima Benarafa +2 more
doaj +1 more source
Matrix black box algorithms - a survey [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2022 The implementations of matrix multiplication on contemporary, vector-oriented, and multicore-oriented computer hardware are very carefully designed and optimized with respect to their efficiency, due to the essential significance of that operation in ...
Jerzy Respondek
doaj +1 more source
The Complexity of All-switches Strategy Improvement [PDF]
Logical Methods in Computer Science, 2018 Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parameterized by a switching rule, and one of the most natural rules is "all switches" which switches as many edges as
John Fearnley, Rahul Savani
doaj +1 more source
Applying CEGAR to the Petri Net State Equation [PDF]
Logical Methods in Computer Science, 2012 We propose a reachability verification technique that combines the Petri net state equation (a linear algebraic overapproximation of the set of reachable states) with the concept of counterexample guided abstraction refinement. In essence, we replace the
Karsten Wolf, Harro Wimmel
doaj +1 more source