51![Communication Networks Prof. Laurent Vanbever Exercises week 3 – Routing Dijkstra’s Algorithm Communication Networks Prof. Laurent Vanbever Exercises week 3 – Routing Dijkstra’s Algorithm](https://www.pdfsearch.io/img/8cfe7769db3e7c91198906bce2b9982a.jpg) | Add to Reading ListSource URL: comm-net.ethz.chLanguage: English - Date: 2018-04-20 12:01:31
|
---|
52![High-Speed and Low-Power Multipliers Using the Baugh-Wooley Algorithm and HPM Reduction Tree Magnus Själander and Per Larsson-Edefors Department of Computer Science and Engineering Chalmers University of Technology, SE- High-Speed and Low-Power Multipliers Using the Baugh-Wooley Algorithm and HPM Reduction Tree Magnus Själander and Per Larsson-Edefors Department of Computer Science and Engineering Chalmers University of Technology, SE-](https://www.pdfsearch.io/img/34b3159d6dbfa01b95f61630d692978c.jpg) | Add to Reading ListSource URL: www.sjalander.comLanguage: English - Date: 2012-05-31 04:43:16
|
---|
53![Algebraic Groups 14Lxx [1] Thomas Bayer, An algorithm for computing invariants of linear actions of algebraic groups up to a given degree, J. Symbolic Comput), no. 4, 441–449. MR MR1976577 (2004c:13045) Algebraic Groups 14Lxx [1] Thomas Bayer, An algorithm for computing invariants of linear actions of algebraic groups up to a given degree, J. Symbolic Comput), no. 4, 441–449. MR MR1976577 (2004c:13045)](https://www.pdfsearch.io/img/60a8a0d016b4b918e65a07fa660f5db9.jpg) | Add to Reading ListSource URL: magma.maths.usyd.edu.auLanguage: English |
---|
54![An Improved FOCUSS-Based Learning Algorithm for Solving Sparse Linear Inverse Problems Joseph F. Murray and Kenneth Kreutz-Delgado Electrical and Computer Engineering University of California, San Diego La Jolla, CA 9209 An Improved FOCUSS-Based Learning Algorithm for Solving Sparse Linear Inverse Problems Joseph F. Murray and Kenneth Kreutz-Delgado Electrical and Computer Engineering University of California, San Diego La Jolla, CA 9209](https://www.pdfsearch.io/img/87498f2064bbc37f51b6954d6aa6bef0.jpg) | Add to Reading ListSource URL: dsp.ucsd.eduLanguage: English - Date: 2010-10-10 22:51:20
|
---|
55![Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts P. Mihailescu ˘ Mathematisches Institut Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts P. Mihailescu ˘ Mathematisches Institut](https://www.pdfsearch.io/img/0b60977aae9e68368387483ca5e8c044.jpg) | Add to Reading ListSource URL: cs.uwaterloo.caLanguage: English - Date: 2015-10-14 23:45:44
|
---|
56![TASK If you break a stick uniformly in two places, you will be left with three segments. Write an algorithm for computing the probability that the three segments form a triangle. This algorithm is supposed to employ Metr TASK If you break a stick uniformly in two places, you will be left with three segments. Write an algorithm for computing the probability that the three segments form a triangle. This algorithm is supposed to employ Metr](https://www.pdfsearch.io/img/33a33e0d598a48ab315b113cb2248dfc.jpg) | Add to Reading ListSource URL: www.stanfordphd.comLanguage: English - Date: 2018-02-16 02:18:46
|
---|
57![1 New results on reduced-round Tiny Encryption Algorithm using genetic programming Karel Kubíˇcek, Jiˇrí Novotný, Petr Švenda, Martin Ukrop Masaryk University, Brno, Czech Republic 1 New results on reduced-round Tiny Encryption Algorithm using genetic programming Karel Kubíˇcek, Jiˇrí Novotný, Petr Švenda, Martin Ukrop Masaryk University, Brno, Czech Republic](https://www.pdfsearch.io/img/97d5833224835d609a61a4acd276616e.jpg) | Add to Reading ListSource URL: crocs.fi.muni.czLanguage: English - Date: 2018-04-25 10:30:18
|
---|
58![Language model adaptation with MAP estimation and the perceptron algorithm Michiel Bacchiani, Brian Roark and Murat Saraclar AT&T Labs-Research, 180 Park Ave., Florham Park, NJ 07932, USA {michiel,roark,murat}@research.a Language model adaptation with MAP estimation and the perceptron algorithm Michiel Bacchiani, Brian Roark and Murat Saraclar AT&T Labs-Research, 180 Park Ave., Florham Park, NJ 07932, USA {michiel,roark,murat}@research.a](https://www.pdfsearch.io/img/ac0fa158bd0c5c79eb44997193d55bd9.jpg) | Add to Reading ListSource URL: www.aclweb.orgLanguage: English - Date: 2010-06-14 20:48:20
|
---|
59![THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, FAST, BYZANTINE FAULT TOLERANCE LEEMON BAIRD MAY 31, 2016 SWIRLDS TECH REPORT SWIRLDS-TR THE SWIRLDS HASHGRAPH CONSENSUS ALGORITHM: FAIR, FAST, BYZANTINE FAULT TOLERANCE LEEMON BAIRD MAY 31, 2016 SWIRLDS TECH REPORT SWIRLDS-TR](https://www.pdfsearch.io/img/02830a9c31206c764996e1db6bace2c3.jpg) | Add to Reading ListSource URL: www.swirlds.comLanguage: English - Date: 2018-03-18 21:05:46
|
---|
60![Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm](https://www.pdfsearch.io/img/7a5c8d100b5112b25e80fa963490ad3a.jpg) | Add to Reading ListSource URL: www.diego-perez.netLanguage: English - Date: 2014-09-01 11:09:24
|
---|