Results 21 to 30 of about 683,541 (259)
Termination of Triangular Integer Loops is Decidable [PDF]
, 2019 We consider the problem whether termination of affine integer loops is decidable. Since Tiwari conjectured decidability in 2004, only special cases have been solved.
A Tiwari +7 more
core +3 more sources
Fully Homomorphic Encryption Scheme for Securing Cloud Data
UHD Journal of Science and Technology, 2023 One of the pioneer and important fields in the computer science area is cloud computing. The data within cloud computing are usually transformed to it from local storage; therefore, the security of this data is an important issue.
Tara Al Attar, Mohammed Anwar MOHAMMED
doaj +1 more source
Integer simulation based optimization by local search
Procedia Computer Science, 2010 AbstractSimulation-based optimization combines simulation experiments used to evaluate the objective and/or constraint functions with an optimization algorithm. Compared with classical optimization, simulation based optimization brings its specific problems and restrictions. These are discussed in the paper.
Sklenar, Jaroslav, Popela, Pavel
openaire +3 more sources
Novel Architecture for Efficient Implementation of Modular Exponentiation Algorithm [PDF]
International Journal of Web ResearchOne of the most difficult problems in web research is security. Cryptography is the fundamental technique utilized in secure communication. One key element of cryptography is Public-Key Cryptography (PKC).
Abdalhossein Rezai
doaj +1 more source
Journal of Mathematics, 2021 The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability.
Shahbaz Ali +3 more
doaj +1 more source
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
AIMS Mathematics, 2023 We introduce the concepts of multiple attribute decision-making (MADM) using square root neutrosophic normal interval-valued sets (SRNSNIVS). The square root neutrosophic (SRNS), interval-valued NS, and neutrosophic normal interval-valued (NSNIV) sets ...
Murugan Palanikumar +5 more
doaj +1 more source
Teaching Students to Use the Gauss Method for Integer Matrices when Implemented on a Computer
Computer tools in education, 2019 The paper is written on the basis of a part of “Analysis of algorithms” course for students of the Computer science department of the Division of mathematics and mechanics of Saint Petersburg State University.
T. Kosovskaya
semanticscholar +1 more source
Parallel Integer Sort: Theory and Practice [PDF]
ACM SIGPLAN Symposium on Principles & Practice of Parallel ProgrammingInteger sorting is a fundamental problem in computer science. This paper studies parallel integer sort both in theory and in practice. In theory, we show tighter bounds for a class of existing practical integer sort algorithms, which provides a solid ...
Xiaojun Dong +3 more
semanticscholar +1 more source
Mathematics and Computer Science :Proceedings of Annual Workshop on Mathematics and Computer Science, March 25, 2014, JOSAI UNIVERSITY [PDF]
, 2014 In the research area of physical random number generation, a kind of “post-process” function to improve the randomness of the generated bit sequence has been studied. There a two-dimensional integer sequence indexed by the input and the output lengths of
縫田, 光司
core +1 more source