Results 11 to 20 of about 410,375 (269)
Efficient Outside Computation [PDF]
Weighted deduction systems provide a framework for describing parsing algorithms that can be used with a variety of operations for combining the values of partial derivations. For some operations, inside values can be computed efficiently, but outside values cannot.
openaire +2 more sources
Efficient Embedded Computing [PDF]
Hardwired ASICs - 50X more efficient than programmable processors - sacrifice programmability to meet the efficiency requirements of demanding embedded systems. Programmable processors use energy mostly to supply instructions and data to the arithmetic units, and several techniques can reduce instruction- and data-supply energy costs.
William J. Dally +7 more
openaire +1 more source
Efficient computation of hashes [PDF]
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel hash tree modes.\ud The main contributions of this paper are, first, the identification of several ...
Lopes, Raul +2 more
openaire +3 more sources
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
Improving the Computational Efficiency of a Variant of Steffensen’s Method for Nonlinear Equations
Steffensen-type methods with memory were originally designed to solve nonlinear equations without the use of additional functional evaluations per computing step.
Fuad W. Khdhr +2 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
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
Although particle swarm optimization (PSO) is a powerful evolutionary algorithm for solving nonlinear optimization problems in deterministic environments, many practical problems have some stochastic noise.
Seon Han Choi, Jang Won Bae
doaj +1 more source

