Results 261 to 270 of about 459,449 (308)

Efficient algorithms for geometric optimization

ACM Computing Surveys, 1998
We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and ...
Pankaj K Agarwal, Micha Sharir, Agarwalpankaj K   +2 more
exaly   +2 more sources

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 A, MONTANARI, UGO GIOVANNI ERASMO   +1 more
openaire   +1 more source

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.
M. V. Bhat, A. Haupt
openaire   +1 more source

Efficient algorithms for merging

BIT, 1983
Efficient algorithms are given to find the maximum lengthn of an ordered list in which 4 elements can be merged using exactlyk comparisons. A top down algorithm for the (2,n) merge problem is discussed and is shown to obtain the optimal merge length first reported by Hwang and Lin.
Vangalur S. Alagar, Tien Dai Bui, Mai Thanh   +2 more
openaire   +1 more source

The efficiency of algorithms—misconceptions

Computers & Education, 2004
The implementation of a new computer science (CS) curriculum in high schools which includes all the basic elements of traditional CS programs, motivated a research to determine how students conceive the very fundamental notion of efficiency. Since this was the first time that algorithm efficiency was integrated into a high school curriculum, our study ...
Judith Gal-Ezer, Ela Zur
openaire   +1 more source

Algorithms, Their Complexity and Efficiency.

Mathematics of Computation, 1982
Evaluation of Polynomials Iterative Processes Direct Methods for Solving Sets of Linear Equations The Fast Fourier Transform Fast Multiplications of Numbers Internal Sorting External Sorting Searching.
Christoph M. Hoffmann, Lydia Kronsjo
openaire   +1 more source

On the Efficiency of Algorithms

Journal of the ACM, 1970
A definition is given of the efficiency of an algorithm considered as a whole. This immediately raises the question of whether it is possible to find the most efficient or “optimum” algorithm. It is shown that an optimization problem of this kind is effectively solvable if and only if the set of arguments with which one is concerned is a finite one ...
openaire   +2 more sources

An efficient algorithm for PMFAP

2016 8th International Conference on Communication Systems and Networks (COMSNETS), 2016
Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented.
Soumen Atta, Priya Ranjan Sinha Mahapatra   +1 more
openaire   +1 more source