Results 221 to 230 of about 30,818 (266)

Comparative analysis of algorithmic approaches in ensemble learning: bagging vs. boosting. [PDF]

Sci Rep
Zhao H, Liu W, Wang Y, Wu L.
europepmc   +1 more source

Energy efficient algorithms

, 2011
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems, 1982
The unification problem in f'mst-order predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given. A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nondeterministic one, and a PASCAL implementation is given.
MARTELLI, Alberto, U. Montanari
openaire   +2 more sources

Engineering Efficient Paging Algorithms

ACM Journal of Experimental Algorithmics, 2012
In the field of online algorithms, paging is a well-studied problem. LRU is a simple paging algorithm that incurs few cache misses and supports efficient implementations. Algorithms outperforming LRU in terms of cache misses exist but are in general more complex and thus not automatically better, since their increased runtime might ...
Moruz, Gabriel, Negoescu, Andrei, Neumann, Christian, Weichert, Volker   +3 more
openaire   +1 more source

Efficient fitting algorithm

2021
Abstract: An efficient model-based estimation algorithm is introduced to quantify the atomic column positions and intensities from atomic-resolution (scanning) transmission electron microscopy ((S)TEM) images. This algorithm uses the least squares estimator on image segments containing individual columns fully accounting for overlap between neighboring
de Backer, Annick, Fatermans, Jarmo, den Dekker, Arjan, Van Aert, Sandra   +3 more
openaire   +3 more sources

An Efficient Clustering Algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1976
A new algorithm is presented (called matching algorithm), in order to reorganize data data and identify clusters. Thus the algorithm requires only three integer additions in each step, instead of comparing the entire row to evaluate the matchings with the neighboring rows.
Bhat, M. V., Haupt, A.
openaire   +1 more source

Efficient routing algorithm

Computer-Aided Design, 1987
Abstract The line expansion algorithm provided by Heynes was a new kind of routing algorithm that took advantage of both Lee's algorithm and linear expansion algorithms, and hence was more efficient. However, it was less efficient in two layer routing situations.
Shi Kai-jian, Zhu Hong-e
openaire   +1 more source

Efficient sequence alignment algorithms

Journal of Theoretical Biology, 1984
Sequence alignments are becoming more important with the increase of nucleic acid data. Fitch and Smith have recently given an example where multiple insertion/deletions (rather than a series of adjacent single insertion/deletions) are necessary to achieve the correct alignment. Multiple insertion/deletions are known to increase computation time from O(
openaire   +2 more sources

Efficient MPC Algorithms

2012
Computing the control input for constrained model predictive control (MPC) is a complex and time-consuming process. The constrained problem formulation does not allow the control law to be expressed as a closed equation; instead, a numerical optimization problem has to be performed online at each sampling period.
Gergely Takács, Boris Rohal’-Ilkiv
openaire   +1 more source

Efficient multicanonical algorithms

IEEE Photonics Technology Letters, 2005
Motivated by our recent work on the application of multicanonical sampling to experimental measurements, we here examine the reduction of statistical error through weighted least squares fitting procedures. Our method, which generalizes previous modified multicanonical approaches, also incorporates a novel technique for characterizing statistical ...
null Tao Lu, D. Yevick
openaire   +1 more source