Hamiltonian path

Results: 145



#Item
1Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut

Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut

Add to Reading List

Source URL: matsen.fhcrc.org

Language: English - Date: 2018-06-27 12:49:21
    2How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

    How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b

    Add to Reading List

    Source URL: eulerarchive.maa.org

    Language: English - Date: 2013-11-04 12:20:24
    3How to apply de Bruijn graphs to genome assembly

    How to apply de Bruijn graphs to genome assembly

    Add to Reading List

    Source URL: www.nature.com

    Language: English - Date: 2012-01-20 11:24:28
    4ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

    ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

    Add to Reading List

    Source URL: www.crypto.ethz.ch

    Language: English - Date: 2015-04-20 05:14:26
    5Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

    Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

    Add to Reading List

    Source URL: page.math.tu-berlin.de

    Language: English
    6TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

    TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

    Add to Reading List

    Source URL: www.iwr.uni-heidelberg.de

    Language: English - Date: 2013-06-19 04:16:58
    7TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

    TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

    Add to Reading List

    Source URL: comopt.ifi.uni-heidelberg.de

    Language: English - Date: 2013-06-19 04:16:58
    8Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

    Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

    Add to Reading List

    Source URL: pagesperso.lina.univ-nantes.fr

    Language: English - Date: 2012-04-20 08:45:09
    9An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

    An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

    Add to Reading List

    Source URL: community.dur.ac.uk

    Language: English - Date: 2008-11-30 14:19:38
    10Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles

    Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture) Hamiltonian cycles

    Add to Reading List

    Source URL: www.crypto.ethz.ch

    Language: English - Date: 2015-03-30 06:00:41