Results 1 to 10 of about 1,305,551 (164)
Algorithms Visualization Tool for Students and Lectures in Computer Science
, 2013 The best way to understand complex data structures or algorithm is to see them in action. The present work presents a new tool, especially useful for students and lecturers in computer science. It is written in Java and developed at Bordeaux University of Sciences and Technology. Its purposes is to help students in understanding classical algorithms by
Musumbu, Kaninda
openaire +5 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
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
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
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
Algorithm Development in Computational Materials Science [PDF]
JOM, 2014 1.—Mechanics of Materials Department, Sandia National Laboratories, Livermore, CA 94550, USA. 2.—Materials Science & Technology Division, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA. 3.—Materials Science & Engineering Department, Missouri University of Science and Technology, Rolla, MO 65409, USA.
Jonathan A. Zimmerman +4 more
openaire +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