Results 11 to 20 of about 4,861,317 (256)
Parallel Implementation of Exact Matrix Computation Using Multiple P-adic Arithmetic [PDF]
A P-adic Exact Scientific Computational Library (ESCL) for rational matrix operations has been developed over the past few years. The effort has been focusing on converting all rational number operations to integer calculation, and fully taking advantage
Xinkai Li, Chao Lu, Jon A. Sjogren
doaj +1 more source
Memory-Efficient Fixpoint Computation [PDF]
Abstract Practical adoption of static analysis often requires trading precision for performance. This paper focuses on improving the memory efficiency of abstract interpretation without sacrificing precision or time efficiency. Computationally, abstract interpretation reduces the problem of inferring program invariants to computing a fixpoint
Sung Kook Kim +2 more
openaire +3 more sources
Efficient Hyperdimensional Computing
Hyperdimensional computing (HDC) is a method to perform classification that uses binary vectors with high dimensions and the majority rule. This approach has the potential to be energy-efficient and hence deemed suitable for resource-limited platforms due to its simplicity and massive parallelism.
Zhanglu Yan +3 more
openaire +3 more sources
Solar photovoltaic (PV) electricity generation is growing rapidly in China. Accurate estimation of solar energy resource potential (Rs) is crucial for siting, designing, evaluating and optimizing PV systems.
Zhigao Zhou +3 more
doaj +1 more source
The efficient protection of electric power distribution networks against lightning discharges is a crucial problem for distribution electric utilities.
Gabriel Vianna Soares Rocha +8 more
doaj +1 more source
Bandwidth Trading: A Comparison of the Combinatorial and Multicommodity Approach
Since the telecommunication market becomes more complex and dynamic, a strong need for a new, efficient and flexible bandwidth trading mechanisms appears.
Kamil Kołtyś +3 more
doaj +1 more source
Efficient seed computation revisited [PDF]
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty.
Michalis Christou +8 more
openaire +8 more sources
The finite-volume method in computational rheology [PDF]
The finite volume method (FVM) is widely used in traditional computational fluid dynamics (CFD), and many commercial CFD codes are based on this technique which is typically less demanding in computational resources than finite element methods (FEM ...
Pinho, F.T. +4 more
core +4 more sources
Computation of the non-central chi square probability density function is encountered in diverse fields of applied statistics and engineering. The distribution is commonly computed as a Poisson mixture of central chi square densities, where the terms of ...
Paul J. Gendron
doaj +1 more source
Spot markets provide an interesting opportunity for profit maximization by energy trading based on immediate decisions on participant bids. However, their short market-clearing time can affect computational efficiency, search space, and reliability of ...
Sameer Sabir +5 more
doaj +1 more source

