such a particular trace may not be scheduled for execution. Thus it is useful to compute the probability of executing the trace. Our probabilistic model of real-time systems requires that for each transition, the period
In this paper we build new operators for the theory of lists that compute generalized recurrences and show that they have logarithmic parallel time complexity. As many applications can be cast as forms of recurrences, this allows a large range of parallel algorithms to be derived within the Bird...
Compared to most comparison sorting algorithms' expected O(n log n) time complexity and Algorithm B's θ(n), counting sort falls in between the two with O(n + k) asymptotic time complexity, where k is the range of the input vector. As a bonus, k will be sufficiently small as to ...
Graph Coloring: In graph algorithms, Mex can be applied to find the smallest unused color when coloring vertices, facilitating efficient graph coloring strategies. Closing Note I appreciate this community's feedback, which has helped me correct and improve the content. Mistakes are a part of growt...
The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling relationship between the eigenvector and matrix elements exists....
This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given....
5This observation has lead to an intense scientific effort towards developing and improving quantum algorithms for simulating time evolution6,7and calculating ground state energies8,9,10,11of molecular systems. Small prototypes of these algorithms have been implemented experimentally with much success.10...
A Survey of Algorithms for Calculating Power Indices of Weighted Majority Games This paper deals with the weighted majority game, which is a familiar example of voting systems. In 1960s, U.S. Supreme Court handed down a series of "one ... YM Tomomi Matsui - 《Journal of the Operations Re...
Ivanov, J., Schuurmann, G.: Simple algorithms for determining the molecular symmetry. J. Chem. Inf. Comput. Sci. 39, 728–737 (1999) Article Google Scholar Jones, H.F.: Groups, Representations and Physics. Institute of Physics Publishing, Bristol (1990) Book MATH Google Scholar Kallus...
628-631, May 1990. Orton, G.A, et al.; “VLSI Implementation of Public-Key Encryption Algorithms”; A.M. Odlyzko (Ed.) Advances in Cryptology—CRYPTO '86, LNCS 263, pp. 277-301, 1987. Feb. 28, 2014 Office Action for German Patent Application No. 102006025677.8. ...