Algorithms

Results: 10964



#Item
691

Delayed Information and Action in On-Line Algorithms Susanne Albersy Moses Charikarz

Add to Reading List

Source URL: www14.in.tum.de

- Date: 2013-11-25 11:05:30
    692

    A study of Ant Colony Algorithms and a potential application in Graph Drawing Student Name: A.G. Stewart Supervisor Name: D. Paulusma Submitted as part of the degree of B.Sc. Natural Sciences to the Board of Examiners in

    Add to Reading List

    Source URL: community.dur.ac.uk

    - Date: 2013-10-21 08:23:41
      693

      Algorithms and Data Structures Winter TermExercises for Units 34 & 35 1. Consider a single-item auction with n ≥ 3 bidders and assume that the item is given to the highest bidder. Suppose the payment of the hi

      Add to Reading List

      Source URL: www-tcs.cs.uni-sb.de

      - Date: 2016-03-29 17:41:18
        694

        Reducing Communication in Parallel Graph Computations Aydın  Buluç     Berkeley Lab Workshop on Algorithms for Modern Massive Data Sets (MMDS)

        Add to Reading List

        Source URL: mmds-data.org

        - Date: 2014-06-19 01:47:12
          695

          Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms MICHAEL L. FREDMAN

          Add to Reading List

          Source URL: bioinfo.ict.ac.cn

          - Date: 2014-11-28 11:05:21
            696

            CS364B: Frontiers in Mechanism Design Lecture #9: MIDR Mechanisms via Scaling Algorithms∗ Tim Roughgarden† February 5,

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2014-06-11 16:23:57
              697

              Algorithms and Data Structures (WS15/16) Example Solutions for Units 18 & 19 Problem 4 Point a) extract = [4, 3, 2, 6, 8, 1]

              Add to Reading List

              Source URL: www-tcs.cs.uni-sb.de

              - Date: 2016-03-14 16:34:09
                698

                Algorithms and Data Structures Winter TermExercises for UnitLet A and B be two multisets containing integers from the range 1 through K. We want to test, whether A and B are the same, i.e. they contain th

                Add to Reading List

                Source URL: www-tcs.cs.uni-sb.de

                - Date: 2016-03-23 08:36:41
                  699

                  Evolutionary Algorithms for Quantum Computers Daniel Johannsen ∗ School of Mathematical Sciences

                  Add to Reading List

                  Source URL: www.cse.iitk.ac.in

                  - Date: 2016-07-30 09:35:21
                    700

                    Algorithms and Data Structures Winter TermExercises for Unit 7 In the exercises of this problem set you may assume that you have an algorithm available that computes the product of two degree-n polynomials in ti

                    Add to Reading List

                    Source URL: www-tcs.cs.uni-sb.de

                    - Date: 2016-03-03 04:55:24
                      UPDATE