Search results

...omputing]], '''all-to-all''' (also known as ''index operation'' or ''total exchange'') is a [[collective operation]], where each processor sends an individual ...ly, each processor holds ''p'' messages of size m each, and the goal is to exchange the i-th message of processor j with the j-th message of processor i. ...

[[File:Order-4 shuffle-exchange.svg|thumb|upright=1.3|The order-4 shuffle-exchange network, with its vertices arranged in numerical order]] In [[graph theory]], the '''shuffle-exchange network''' is an [[undirected graph|undirected]] [[cubic graph|cubic]] [[mu ...

...math> is in the family. For the basis sets of a matroid, the corresponding exchange axiom requires in addition that <math>e\in E</math> and <math>f\in F</math> Algorithms for [[matroid intersection]] and the [[matroid parity problem]] can be exte ...

...em]] faced by programs for [[kidney paired donation]]s (also called Kidney Exchange Programs). Such programs have large databases of patient-donor pairs, where ...i |first1=Itai |last2=Roth |first2=Alvin E. |date=2021-09-01 |title=Kidney Exchange: An Operations Perspective |url=https://pubsonline.informs.org/doi/abs/10.1 ...

...the Fock matrix. V. Hierarchical Cubature for numerical integration of the exchange-correlation matrix | doi = 10.1063/1.1316012 | journal = The Journal of Che ...

=== Exchange === * '''Basis-exchange property''': if <math>a\in A\setminus B</math>, then there exists an elemen ...

...Ernst Steinitz]]. The result is often called the '''Steinitz–Mac&nbsp;Lane exchange lemma''', also recognizing the generalization<ref> ...r algebra|linear algebra]] and in [[Matroid#Greedy_algorithm|combinatorial algorithms]].<ref>Page v in Stiefel: ...

...e-based cryptography|lattices]]. Unlike older lattice based cryptographic algorithms, the [[ring learning with errors|RLWE]]-KEX is provably reducible to a know ...[[quantum computer]] of sufficient size were built, all of the public key algorithms based on these three classically hard problems would be insecure. This pub ...

{{Distinguish|Exchange (organized market)}} ...on - there is only an exchange of already-existing goods. An Arrow–Debreu exchange market has the following ingredients: ...

...nvolves many rounds of assignment where the state of the system after each exchange of fire (round) is considered in the next round. While the majority of work == Algorithms and generalizations == ...

...ly different) string, what is the minimal number of bits that they need to exchange in order for Alice to approximately compute the [[Hamming distance]] betwee ...orithm for Estimating the Entropy of a Stream|journal= ACM Transactions on Algorithms|volume=6|issue=3|pages=1–21|doi=10.1145/1798596.1798604|issn=1549-6325|cite ...

...ping the magnitudes of the intermediate coefficients reasonably small. Two algorithms are suggested:<ref name="bareiss">{{citation|first=Erwin H.|last=Bareiss|ti ...k}}&minus;1</sub> ≠ 0 ({{mvar|i}} = {{mvar|k}},...,{{mvar|n}}) then we can exchange the {{mvar|k}}&minus;1-th row with the {{mvar|i}}-th row and change the sig ...

Exchange av[1], av[2], ..., av[k] with bv[1], bv[2], ..., bv[k] [[Category:Combinatorial algorithms]] ...

...ional and memory usage compared with the state of art generic maximum flow algorithms in GTW applications. * Using maximum flow algorithms to obtain the minimum cut of the constructed graph. The minimum cut within ...

...hange algorithm|exchange]] pivoting algorithms and also for interior-point algorithms.{{sfnp|Deza|Nematollahi|Terlaky|2008}} ...its complexity is bounded by a [[cubic polynomial]]. There are examples of algorithms that do not have polynomial-time complexity. For example, a generalization ...

In [[computer science]], '''imperialist competitive algorithms''' are a type of computational method used to solve [[optimization problem] ...oint of view, ICA can be thought of as the social counterpart of [[genetic algorithms]] (GAs). ICA is the mathematical model and the computer simulation of human ...

* It is [[NP-hard]] to say whether a particular family of Leontief exchange economies, that is guaranteed to have at least one equilibrium, has more th Moreover, the Leontief market exchange problem does not have a [[fully polynomial-time approximation scheme]], unl ...

...instead of just one. It is different from the [[Parallel tempering|replica exchange method]] (or parallel tempering), as it performs a non-local update on a fr ...will be correct when used in conjunction with other [[Ergodicity|ergodic]] algorithms. However, the algorithm is not necessarily efficient, as a giant grey clust ...

| title = Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Netwo | journal = ACM Trans. Algorithms ...

...186-6580-7 |doi=10.1109/SFCS.1994.365700 |quote=This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum compute ..., and the smallness bound (<math>b</math>). In many RLWE based public key algorithms the private key will be a pair of small polynomials <math>s(x)</math> and < ...