Algorithmic

Results: 3166



#Item
81

Compositional Algorithmic Verification of Software Product Lines Ina Schaefer1 , Dilian Gurov2 , and Siavash Soleimanifard2 1 2

Add to Reading List

Source URL: www.nada.kth.se

- Date: 2011-09-12 13:20:20
    82

    The Algorithmic Principles of Verifiable Autonomy of Vehicles Prof Sandor M Veres Department of Automa=c Control and Systems Engineering University of Sheffield

    Add to Reading List

    Source URL: vavasdotorg.files.wordpress.com

    - Date: 2016-11-18 05:29:09
      83

      Algorithmic Trading and Computational Finance Michael Kearns Computer and Information Science University of Pennsylvania STOC Tutorial

      Add to Reading List

      Source URL: www.cis.upenn.edu

      - Date: 2012-05-24 11:36:14
        84

        Algorithmic Operator Algebras via Normal Forms for Tensors Jamal Hossein Poor∗, Clemens G. Raab∗, and Georg Regensburger∗ Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of

        Add to Reading List

        Source URL: gregensburger.com

        - Date: 2016-06-11 13:51:08
          85

          CISThe Algorithmic Foundations of Data Privacy October 20, 2011 Lecture 11 Lecturer: Aaron Roth

          Add to Reading List

          Source URL: www.cis.upenn.edu

          - Date: 2011-10-20 16:12:25
            86

            Jason M Rute* (). Schnorr randomness for noncomputable measures. The field of algorithmic randomness allows one to separate the real numbers into those which are random and which are not, w

            Add to Reading List

            Source URL: jointmathematicsmeetings.org

            - Date: 2013-09-19 00:46:25
              87

              USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS ´ NIES, AND JING ZHANG KENSHI MIYABE, ANDRE Abstract. We study algorithmic randomness notions via effective versions of almost-everywhere theorems from

              Add to Reading List

              Source URL: dl.dropboxusercontent.com

                88

                Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ran

                Add to Reading List

                Source URL: people.clas.ufl.edu

                - Date: 2015-02-13 19:35:58
                  89

                  Distributed Graph Coloring in a Few Rounds Kishore Kothapalli∗ Sriram Pemmaraju† Center for Security, Theory, and Algorithmic

                  Add to Reading List

                  Source URL: cstar.iiit.ac.in

                  - Date: 2012-01-01 02:20:20
                    90

                    Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences Chi Jin UC Berkeley

                    Add to Reading List

                    Source URL: people.eecs.berkeley.edu

                    - Date: 2016-10-28 10:22:17
                      UPDATE