Results 351 to 360 of about 11,243,181 (388)

A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation, 2002
Multi-objective evolutionary algorithms (MOEAs) that use non-dominated sorting and sharing have been criticized mainly for: (1) their O(MN/sup 3/) computational complexity (where M is the number of objectives and N is the population size); (2) their non ...
K. Deb, S. Agrawal, Amrit Pratap, T. Meyarivan   +3 more
semanticscholar   +1 more source

An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints

IEEE Transactions on Evolutionary Computation, 2014
Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two and three objectives, there is now a growing need for developing evolutionary ...
K. Deb, Himanshu Jain
semanticscholar   +1 more source

There Are No Algorithms for Teaching Algorithms

Teaching Children Mathematics, 1998
What comes to mind when we hear the word algorithm? We may think of it as a procedure, an efficient method, or a rule for computation. From our own formal school experiences, we may recall pages of skill drill and practice, or lengthy efforts to accomplish rote memorization.
Sydney L. Schwartz, Frances R. Curcio
openaire   +2 more sources

Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper

, 1977
Vibratory power unit for vibrating conveyers and screens comprising an asynchronous polyphase motor, at least one pair of associated unbalanced masses disposed on the shaft of said motor, with the first mass of a pair of said unbalanced masses being ...
A. Dempster, N. Laird, D. Rubin
semanticscholar   +1 more source

A Fast Learning Algorithm for Deep Belief Nets

Neural Computation, 2006
We show how to use complementary priors to eliminate the explaining-away effects that make inference difficult in densely connected belief nets that have many hidden layers.
Geoffrey E. Hinton, Simon Osindero, Y. Teh   +2 more
semanticscholar   +1 more source

Randomized algorithms

ACM Computing Surveys, 1995
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in ...
Rajeev Motwani, Prabhakar Raghavan
openaire   +2 more sources

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

, 1986
We present an iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace.
Y. Saad, M. Schultz
semanticscholar   +1 more source

An algorithm for suffix stripping

Program, 1997
The automatic removal of suffixes from words in English is of particular interest in the field of information retrieval. An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL.
M. Porter
semanticscholar   +1 more source

(algorithms)

ACM SIGPLAN Lisp Pointers, 1988
I have not been deluged with submissions for this column. I've gotten a few, but not enough to make it easy to put out another issue each quarter. Let me therefore repeat my charter: The (algorithms) department consists of articles that fit into one or more of three broad categories: • Annotated implementations of interesting and ...
openaire   +1 more source

An Algorithm for Vector Quantizer Design

IEEE Transactions on Communications, 1980
An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.
Y. Linde, A. Buzo, R. Gray
semanticscholar   +1 more source