Algorithm

Results: 17634



#Item
51Communication Networks Prof. Laurent Vanbever Exercises week 3 – Routing  Dijkstra’s Algorithm

Communication Networks Prof. Laurent Vanbever Exercises week 3 – Routing Dijkstra’s Algorithm

Add to Reading List

Source URL: comm-net.ethz.ch

Language: English - Date: 2018-04-20 12:01:31
52High-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-

Add to Reading List

Source URL: www.sjalander.com

Language: English - Date: 2012-05-31 04:43:16
    53Algebraic 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)

    Add to Reading List

    Source URL: magma.maths.usyd.edu.au

    Language: English
      54An 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

      Add to Reading List

      Source URL: dsp.ucsd.edu

      Language: English - Date: 2010-10-10 22:51:20
        55Computing 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

        Add to Reading List

        Source URL: cs.uwaterloo.ca

        Language: English - Date: 2015-10-14 23:45:44
          56TASK 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

          Add to Reading List

          Source URL: www.stanfordphd.com

          Language: English - Date: 2018-02-16 02:18:46
            571  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

            Add to Reading List

            Source URL: crocs.fi.muni.cz

            Language: English - Date: 2018-04-25 10:30:18
              58Language 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

              Add to Reading List

              Source URL: www.aclweb.org

              Language: English - Date: 2010-06-14 20:48:20
                59THE 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

                Add to Reading List

                Source URL: www.swirlds.com

                Language: English - Date: 2018-03-18 21:05:46
                  60Fast 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

                  Add to Reading List

                  Source URL: www.diego-perez.net

                  Language: English - Date: 2014-09-01 11:09:24