Search results

...for [[Stack (abstract data type)|stack]] processing by [[Richard Mattson]] in 1971.<ref>{{cite journal|date=December 1971|title=Evaluation of multilevel ...3=T. R.|last4=Emma|first4=P. G.|title=Proceedings of the 3rd conference on Computing frontiers |chapter=Cache miss behavior |date=2006-01-01|chapter-url=http:// ...

*[[Andrea Corr]] (born 1974), Irish musician ==Places in Ireland== ...

...y form the finest partition of the set of vertices that is totally ordered in this way. The weak components were defined in a 1972 paper by [[Ronald Graham]], [[Donald Knuth]], and (posthumously) [[T ...

...ebruary 2018 |bot=InternetArchiveBot |fix-attempted=yes }}</ref> formed by computing the ratio of the amplitude of the acoustic energy at the [[nares]], A<sub>n ...the Measurement of Nasalance - Mask Based Nasometry}}</ref> in the manner in which the oral and nasal acoustic energies are separated physically, as by ...

...istance spanning tree''', or '''minimum average distance spanning tree'''. In an unweighted graph, this is the spanning tree of minimum [[Wiener index]]. {{harvtxt|Hu|1974}} writes that the problem of constructing these trees was proposed by Franc ...

In [[algebra]], '''[[linear equation]]s''' and '''[[systems of linear equation In the case of a single equation, the problem splits in two parts. First, the '''[[ideal membership problem]]''', which consists, g ...

'''Rolf Rannacher''' (born 10 June 1948 in [[Leipzig]]) is a German mathematician and a professor of [[numerical analy ...1988 a professor at [[Saarland University]]. Since 1988 he is a professor in Heidelberg. ...

...]] on the circle. It has one [[vertex (graph theory)|vertex]] for each arc in the set, and an [[edge (graph theory)|edge]] between every pair of vertices :<math> \{I_\alpha, I_\beta\} \in E \iff I_\alpha \cap I_\beta \neq \varnothing. </math> ...

In [[floating-point arithmetic]], the '''Sterbenz lemma''' or '''Sterbenz's le It is named after Pat H. Sterbenz, who published a variant of it in 1974.<ref name="sterbenz">{{cite book ...

| caption1 = In 3D ...J. Born. "The Parallel Genetic Algorithm as Function Optimizer ". Parallel Computing, 17, pages 619&ndash;632, 1991.</ref> Finding the minimum of this function ...

...ician [[Peter Vámos]], who first described it in an unpublished manuscript in 1968.<ref>{{citation ...ements are also independent. The five exceptions are four-element circuits in the matroid. Four of these five circuits are formed by faces of the cuboid ...

..., also called a '''zigzag poset''', is a [[partially ordered set]] (poset) in which the order [[Relation (mathematics)|relations]] form a path with alter ...inite]], or it may be formed by an infinite alternating sequence extending in both directions. The [[incidence poset]]s of [[path graph]]s form examples ...

...humb|360px|A 2-vertex-connected graph, its square, and a Hamiltonian cycle in the square]] ...nian. It is named after [[Herbert Fleischner]], who published its proof in 1974. ...

...aller, their [[power density]] stays constant, so that the power use stays in proportion with area; both [[voltage]] and [[Electric current|current]] sca ...urnal of Solid-State Circuits |volume = SC-9 |number = 5 |doi=10.1109/JSSC.1974.1050511 |pages=256–268|bibcode = 1974IJSSC...9..256D |s2cid = 283984 }}<br/ ...

...cause one must reason about the behavior of multiple cooperating [[Thread (computing)|threads]] of execution. One of the primary goals of parallel analysis is t ...example, the WT framework was adopted as the basic presentation framework in the parallel algorithms books (for the [[parallel random-access machine]] P ...

...for [[numerical integration]]. It is a variant of [[Gaussian quadrature]], in which the evaluation points are chosen so that an accurate approximation ca These formulas are named after [[Alexander Kronrod]], who invented them in the 1960s, and [[Carl Friedrich Gauss]]. ...

...tic|floating-point]] algorithm for computing the exact [[round-off error]] in a floating-point addition operation. 2Sum and its variant Fast2Sum were first published by Ole Møller in 1965.<ref name="moeller">{{cite journal ...

...is a [[mathematical theorem]] in [[sieve theory]]. It is a key ingredient in proofs of [[Chen's theorem]] on [[Goldbach's conjecture]].<ref name="Nathan ...com/books?id=8HA7l7i6SRkC |accessdate=2009-03-14 | series=[[Graduate Texts in Mathematics]] |volume=164 |year=1996 |publisher=[[Springer-Verlag]] | isbn= ...

{{AFC comment|1=From both his publication record and being an editor in chief he passes [[WP:NPROF]]; I do not agree with the prior statements. How Jim Pitman (James W. Pitman) was born in Hobart, Australia, in June 1949, ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ...mal number of bins possible for the list L. The analysis of FF(L) was done in several steps. ...