Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...s [[substitute goods]], so that the utility of a donor is the sum of money distributed to a facility he likes. Consider the following possible distributions: ...goods]], so that the utility of a donor is the ''minimum'' amount of money distributed to a facility he likes. In this case, the uncoordinated distribution 1500,3 ...
    19 KB (2,744 words) - 17:39, 22 May 2024
  • ...y Centre for Security, Reliability and Trust (SnT) at the 2016 Network and Distributed System Security Symposium. The algorithm is based on a generalization of th ...tem Security Symposium 2016 in [[San Diego]]. Notable [[blockchain]]-based projects such as [[ZCash]], BitcoinZ, Horizen, Aion, Hush, and [[Pirate Chain]] have ...
    6 KB (786 words) - 19:36, 15 November 2024
  • {{short description|Large-scale European distributed Research Infrastructure for ocean observation}} ...Seafloor and water-column Observatory''' (EMSO) is a large-scale European distributed Research Infrastructure<ref>{{cite web|url=https://research-and-innovation. ...
    21 KB (2,908 words) - 23:56, 15 November 2024
  • {{short description|Formula for computing the nth base-16 digit of π}} ...{pi}} (and therefore also the ''4n''th [[binary digit]] of {{pi}}) without computing the preceding digits. This does ''not'' compute the ''n''th decimal digit o ...
    14 KB (2,132 words) - 03:31, 1 March 2025
  • * Distributed storage on disks or [[Computer network|networks]] * Image [[Fingerprint (computing)|fingerprinting]] and image [[cryptography]] schemes ...
    27 KB (3,978 words) - 18:39, 4 December 2024
  • ...28526.3329557 |series=EC '19 |location=New York |publisher=Association for Computing Machinery |pages=751–752 |doi=10.1145/3328526.3329557 |arxiv=1905.00457 |is ...is possible to ask the worker for aggregate budget-proposals (for several projects at once). The experiment shows that this approach can indeed improve the ef ...
    29 KB (4,277 words) - 18:12, 24 November 2024
  • ...to overcome [[bufferbloat]] in [[networking hardware]], such as [[router (computing)|router]]s, by setting limits on the delay [[network packet]]s experience a ...ker". From there, CoDel and FQ-CoDel have migrated into various downstream projects such as [[Tomato (firmware)|Tomato]], [[dd-wrt]], [[OPNsense]] and [[Ubiqui ...
    17 KB (2,512 words) - 16:43, 17 August 2024
  • ...n and the memory use are competitive with those of the [[Lanczos method]], computing a single extreme eigenpair of a symmetric matrix. ...ditioned Conjugate Gradient Method| journal = [[SIAM Journal on Scientific Computing]]| volume = 23| issue = 2| pages = 517–541| year = 2001| last1 = Knyazev | ...
    37 KB (5,037 words) - 06:53, 15 February 2025
  • During 1981—1982, it was distributed in two variants, by Atari, Inc. itself and by the [[Atari Program Exchange] ...e=Explore Atari Computer Sales Brochures and Catalogs (10-15 mins) – Atari Projects |url=https://atariprojects.org/2020/09/06/explore-atari-computer-sales-broc ...
    32 KB (4,022 words) - 09:30, 30 January 2025
  • ...ar=2006 |title=Mixed-effects models in S and S-PLUS |series=Statistics and Computing |location=New York |publisher=Springer Science & Business Media |doi=10.100 ...onlinear mixed-effects models – typically under the assumption of normally distributed random variables. A popular approach is the Lindstrom-Bates algorithm<ref>{ ...
    22 KB (3,291 words) - 17:32, 2 January 2025
  • The majority of projects define extensions to the [[IEEE 802.1Q]]{{snd}} Bridges and Bridged Network ...o [[IEEE 802.1Q]], time is very important in TSN networks. For [[Real-time computing|real-time]] communication with hard, non-negotiable time boundaries for end ...
    60 KB (8,598 words) - 20:49, 10 February 2025
  • ...702(01)00129-1 |issn=0004-3702 |publisher=Elsevier}}</ref> and [[AlphaGo]] projects demonstrate how to optimize the performance of agents in pure competition s ...for Collective Robot Learning |journal=The 16th International Symposium on Distributed Autonomous Robotic Systems |publisher=Springer|arxiv= 2207.03530 }}</ref>]] ...
    29 KB (3,808 words) - 04:39, 30 December 2024
  • ...encedirect.com/science/article/pii/S156849461930674X |journal=Applied Soft Computing |volume=86 |pages=105893 |doi=10.1016/j.asoc.2019.105893 |s2cid=209928171}} ...minimize ordinal violation for pairwise comparisons |journal=Applied Soft Computing |volume=106 |pages=107287 |doi=10.1016/j.asoc.2021.107287|s2cid=233657592 | ...
    34 KB (4,470 words) - 09:39, 18 January 2025
  • ...r of the book, intended to show how humans themselves have difficulties in computing this predicate.<ref>Minsky-Papert 1972:74 shows the figures in black and wh ...ps found themselves competing for funding and people, and their demand for computing power far outpaced available supply.<ref>{{cite arXiv |last=Hwang |first=Ti ...
    37 KB (5,465 words) - 20:39, 10 October 2024
  • ...6577.pdf|series=EC '19|location=Phoenix, AZ, USA|publisher=Association for Computing Machinery|pages=753–781|doi=10.1145/3328526.3329552|isbn=978-1-4503-6792-9| ...ristian|last6=Suksompong|first6=Warut|date=2021-10-01|title=Funding Public Projects: A Case for the Nash Product Rule|journal=Journal of Mathematical Economics ...
    25 KB (3,694 words) - 21:49, 28 December 2024
  • ...plementation on Sourceforge |date=7 July 2014 |url=https://sourceforge.net/projects/iforest/}}</ref> It has a linear time complexity and a low memory use, whi ...e of random partitioning in a 2D dataset of [[Normal distribution|normally distributed]] points is shown in the first figure for a non-anomalous point and in the ...
    37 KB (5,289 words) - 22:13, 11 January 2025
  • ...ddresses this problem of maintaining a high degree of entanglement between distributed quantum states by transforming N copies of an arbitrary entangled state <ma ...ators in <math>\mathcal{S}</math>. The [[quantum measurement|measurement]] projects <math>\left\vert \Phi_{n}^{+}\right\rangle</math> randomly onto one of the ...
    41 KB (6,146 words) - 05:13, 19 December 2024
  • ...s by using far fewer physical resources than a full linear-optical quantum computing setup. This advantage makes it an ideal candidate for demonstrating the pow ...Hilbert space corresponding to a system of ''M'' indistinguishable photons distributed among ''N'' modes is given by the [[binomial coefficient]] <math>\tbinom {M ...
    52 KB (7,358 words) - 09:35, 4 January 2024
  • Use of Bayes' law to compute model weights requires computing the probability of the data given each model. Typically, none of the models ...data. By contrast, BMC converges toward the point where this distribution projects onto the simplex. In other words, instead of selecting the one model that i ...
    53 KB (7,534 words) - 06:25, 28 February 2025
  • ...|url=https://link.springer.com/10.1007/s00521-022-07366-3 |journal=Neural Computing and Applications |language=en |volume=34 |issue=16 |pages=13371–13385 |doi= ...neural network learns by gradient descent to generate keys and values for computing the weight changes of the fast neural network which computes answers to que ...
    49 KB (7,226 words) - 16:31, 20 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)