Results 301 to 310 of about 7,186,792 (335)
Some of the next articles are maybe not open access.
There Are No Algorithms for Teaching Algorithms
Teaching Children Mathematics, 1998What 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
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
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
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
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
ACM SIGPLAN Lisp Pointers, 1991
It is my intention to publish two different kinds of algorithms articles: articles that present utilities built on top of Common Lisp and articles that discuss and explain interesting parts of Common Lisp. The following article is an example of the latter type.
openaire +1 more source
It is my intention to publish two different kinds of algorithms articles: articles that present utilities built on top of Common Lisp and articles that discuss and explain interesting parts of Common Lisp. The following article is an example of the latter type.
openaire +1 more source
Concept of an Algorithm. Correctness of Algorithms
2018Algorithm is an exact prescription determining the computation process, leading from the varying source data to the sough result (data is the ordered set of characters). In other words, an algorithm describes the certain computation procedure, with the help of which the computation problem is solved.
Sergei Borzunov, Sergei Kurgalin
openaire +2 more sources
Algorithms Creating Algorithms
2010The spontaneous synthesis of algorithms in artificial neural networks is experimented and analyzed on three hierarchical levels and there are three basic problems: How the engram of memory connects the neuron state and the combination of messages from other neurons. How the cortical column decodes the parallel series of impulses from other columns. How
openaire +2 more sources
The College Mathematics Journal, 1987
(1987). Algorithm of The Bi_Month. The College Mathematics Journal: Vol. 18, No. 2, pp. 153-156.
openaire +2 more sources
(1987). Algorithm of The Bi_Month. The College Mathematics Journal: Vol. 18, No. 2, pp. 153-156.
openaire +2 more sources
, 2011 The Expectation-Maximization (EM) algorithm is a broadly applicable approach to the iterative computation of maximum likelihood estimates in a wide variety of incomplete-data problems. The EM algorithm has a number of desirable properties, such as its numerical stability, reliable global convergence, and simplicity of implementation. There are, however,
Ng, Shu-Kay +2 more
openaire +5 more sources