Search results

{{Use American English|date=January 2019}}{{Short description|Description of limiting behavior in probabilistic algorithms}} ...number ''n'' and goes to 1 as ''n'' goes to infinity, i.e. the probability of the [[Event (probability theory)|event]] occurring can be made as close to ...

{{short description|Distributed computing model}} ...revious state, and the result of the computation can be read in the states of the agents once the computation has [[convergence (mathematics)|converged]] ...

...'' square amplitude [[matrix (mathematics)|matrix]]. An important property of the gradient representation is the following: A given ''M x M'' matrix wher The original concept of GPA was introduced by Rosa, Sharma and Valdivia in 1999.<ref name=Rosa99>Ro ...

{{redirect|Elastic computing|the physical property|Elasticity (physics)|the economics measurement|Elasti ...Responsive Elastic Computing |date=15 June 2009 |publisher=Association for Computing Machinery |isbn=978-1-60558-578-9|display-authors=etal}}</ref> ...

..., whereas in most other statistical contexts it is referred to the concept of a spatial Poisson process.<ref name="Omaimon2010DataM"/> ...iform subdivision. The events of a pattern are independently and uniformly distributed over space; in other words, the events are equally likely to occur anywhere ...

...ef> was initially proposed by Xian-He Sun and Lionel Ni at the Proceedings of [[ACM/IEEE Supercomputing Conference|IEEE Supercomputing Conference 1990]]. ...its memory-bounded function, ''W=G(M)'', it reveals the trade-off between computing and memory in algorithm and [[Computer architecture|system architecture]] d ...

...od for [[sampling (statistics)|sampling]] from the stationary distribution of a [[Markov chain]]. Contrary to many MCMC algorithms, coupling from the pas ...sition probability of <math>M</math> from state <math>s</math>. An example of such a [[probability distribution]] is the one where <math>f(s)</math> is [ ...

...lem in [[computational complexity theory|complexity theory]], with several applications in [[cryptography]]. In short, given two functions ''f'', ''g'', viewed as .../math>. So if <math>|A| \cdot |B| \geq |C|</math>, the [[expected number]] of claws is at least 1. ...

{{Short description|Distributed algorithm for sensor networks}} |title = Robust Distributed Computing and Sensing Algorithm ...

...up until the originator's shutdown. When the destination identifies a lack of heartbeat messages during an anticipated arrival period, the destination ma ...hines, it is important to take into account partitioning, where two halves of the network could be functioning but not able to communicate with each othe ...

...y answers whether an element is in a set or not with a false positive rate of <math>\epsilon</math>. AMQ filters have numerous applications, mainly in distributed systems and databases. There, they are often used to avoid network request ...

{{about|a theoretical model for parallel algorithms|the general concept of computing with many parallel devices|massively parallel}} ...a theoretical model of computing, intended as an abstraction for parallel computing systems that use frameworks such as [[MapReduce]], and frequently applied t ...

{{Short description|Data structure in distributed computing}} ...sbn=978-3-540-24302-1|pages=28–37|edition=SOFSEM 2005: Theory and Practice of Computer Science|doi=10.1007/978-3-540-30577-4_3|series=Lecture Notes in Co ...

{{Short description|Type of queue}} ...hen | title=Queueing-theoretic Solution Methods for Models of Parallel and Distributed Systems | number=BS-R9425 | institution=[[Centrum Wiskunde & Informatica|CW ...

...]], and may involve asking a question such as: What is the expected number of bins with a ball in them?<ref>{{Cite web |last=Oliveira |first=Rafael |date ...ashing schemes, randomized load balancing of tasks on servers, and routing of packets within parallel networks and data centers.<ref name=":0" /> ...

...nclude thousands of numbers that represent a point in a space of thousands of dimensions,<ref name=":0">{{Cite web |last=Ananthaswamy |first=Anan |date=A ...od.berkeley.edu/wp-content/uploads/2021/08/Thomas2021.pdf |journal=Journal of Artificial Intelligence Research |language=en |volume=72 |pages=215–249 |do ...

...mong agents with different valuations over the items, such that the amount of [[Envy-freeness|envy]] is as small as possible. ...blem]], in which the [[loss function]] is a function describing the amount of envy. In general, this optimization problem is [[NP-hardness|NP-hard]], sin ...

<!-- This article was started in British English and so makes extensive use of chi-squared rather than chi-square --> ...-centrality parameters of chi-square components<br /><math>s</math>, scale of normal term<br /><math>m</math>, offset ...

...|s2cid=15200455 }}</ref> KHOPCA operates proactively through a simple set of rules that defines clusters, which are optimal with respect to the applied KHOPCA's clustering process explicitly supports joining and leaving of nodes, which makes KHOPCA suitable for highly dynamic networks. However, it ...

...''worst case''. By giving a security reduction to the worst-case scenario of a difficult mathematical problem, SWIFFT gives a much stronger security gua ...refore, its practical use would lie mostly in applications where the proof of collision-resistance is particularly valuable, such as digital signatures t ...