Analysis of algorithms

Results: 1454



#Item
1A comparison of the Oligomap and TargetScan algorithms for miRNA target analysis Badreddin Edris BIOC 218 Final Project (Win-09) Stanford University Introduction

A comparison of the Oligomap and TargetScan algorithms for miRNA target analysis Badreddin Edris BIOC 218 Final Project (Win-09) Stanford University Introduction

Add to Reading List

Source URL: biochem218.stanford.edu

Language: English - Date: 2009-03-22 03:15:15
    2M Zuhair Nashed* (). Concepts of Differentiability in Smooth and Non-smooth Analysis with Applications in Optimization Theory and Algorithms. Preliminary report. In this talk I will pro

    M Zuhair Nashed* (). Concepts of Differentiability in Smooth and Non-smooth Analysis with Applications in Optimization Theory and Algorithms. Preliminary report. In this talk I will pro

    Add to Reading List

    Source URL: jointmathematicsmeetings.org

    - Date: 2013-09-19 00:50:13
      3Experimental Analysis of Receding Horizon Planning Algorithms for Marine Monitoring Soo-Hyun Yoo, Andrew Stuntz, Yawei Zhang, Robert Rothschild, Geoffrey A. Hollinger and Ryan N. Smith Abstract Autonomous surface vehicl

      Experimental Analysis of Receding Horizon Planning Algorithms for Marine Monitoring Soo-Hyun Yoo, Andrew Stuntz, Yawei Zhang, Robert Rothschild, Geoffrey A. Hollinger and Ryan N. Smith Abstract Autonomous surface vehicl

      Add to Reading List

      Source URL: research.engr.oregonstate.edu

      Language: English - Date: 2015-05-22 19:32:17
        4Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 1, pp. 375–DOI: jgaaSensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

        Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 1, pp. 375–DOI: jgaaSensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

        Add to Reading List

        Source URL: web.eecs.umich.edu

        Language: English - Date: 2015-09-06 15:09:08
          5Analysis of stochastic technical trading algorithms by Markus Höchstötter, Mher Safarian, Anna Krumetsadik 

          Analysis of stochastic technical trading algorithms by Markus Höchstötter, Mher Safarian, Anna Krumetsadik 

          Add to Reading List

          Source URL: econpapers.wiwi.kit.edu

          Language: English - Date: 2016-06-12 13:43:19
            6Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel with Cedric Chauve, Marni Mishna and Dominique Rossin Algorithms and Permutations 2012

            Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel with Cedric Chauve, Marni Mishna and Dominique Rossin Algorithms and Permutations 2012

            Add to Reading List

            Source URL: igm.univ-mlv.fr

            Language: English - Date: 2012-02-17 08:37:26
              7Introduction Generic Decoding Algorithms Asymptotic Analysis over the field size Results Asymptotic Analysis of ISD algorithms for

              Introduction Generic Decoding Algorithms Asymptotic Analysis over the field size Results Asymptotic Analysis of ISD algorithms for

              Add to Reading List

              Source URL: jc2-2017.inria.fr

              Language: English - Date: 2017-05-09 09:15:24
                8Post-doctoral position in algorithms for cancer data analysis Our group is looking for a post-doctoral researcher to develop methodology for the analysis of cancer epigenetics data (1 year project). We have already deve

                Post-doctoral position in algorithms for cancer data analysis Our group is looking for a post-doctoral researcher to develop methodology for the analysis of cancer epigenetics data (1 year project). We have already deve

                Add to Reading List

                Source URL: boevalab.com

                Language: English - Date: 2016-07-18 14:00:42
                  9CS38: Introduction to Algorithms course information and tentative schedule Catalog description: This course introduces techniques for the design and analysis of efficient algorithms. Major design techniques (the greedy a

                  CS38: Introduction to Algorithms course information and tentative schedule Catalog description: This course introduces techniques for the design and analysis of efficient algorithms. Major design techniques (the greedy a

                  Add to Reading List

                  Source URL: users.cms.caltech.edu

                  Language: English - Date: 2014-04-18 01:18:12
                    10Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID#

                    Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID#

                    Add to Reading List

                    Source URL: biochem218.stanford.edu

                    Language: English - Date: 2005-03-28 18:49:38