Partition problem

Results: 66



#Item
1THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai

THE f (q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS KATHRIN BRINGMANN AND KEN ONO Abstract. In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtai

Add to Reading List

Source URL: www.mathcs.emory.edu

Language: English - Date: 2010-08-24 14:06:47
    2An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt

    An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt

    Add to Reading List

    Source URL: mmds-data.org

    - Date: 2016-06-23 15:50:48
      3Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in

      Minimum Common String Partition Problem: Hardness and Approximations Avraham Goldstein? , Petr Kolman?? , and Jie Zheng? ? ? Abstract. String comparison is a fundamental problem in computer science, with applications in

      Add to Reading List

      Source URL: kam.mff.cuni.cz

      - Date: 2004-08-19 17:02:18
        4The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗

        The Greedy Algorithm for the Minimum Common String Partition Problem Marek Chrobak∗ Petr Kolman†∗

        Add to Reading List

        Source URL: kam.mff.cuni.cz

        - Date: 2004-07-23 20:18:41
          5Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the

          Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 6, duepts total) Recall that the Kernighan-Lin heuristic begins with a random partition of the

          Add to Reading List

          Source URL: tuvalu.santafe.edu

          - Date: 2013-11-23 11:09:30
            6System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1].

            System Time Distribution of Dynamic Traveling Repairman Problem under the PART-n-TSP Policy Jiangchuan Huang and Raja Sengupta Abstract— We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1].

            Add to Reading List

            Source URL: cpcc.berkeley.edu

            Language: English - Date: 2016-06-12 17:08:37
            7The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

            The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

            Add to Reading List

            Source URL: users.cms.caltech.edu

            Language: English - Date: 2008-11-17 17:17:16
            8CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22,

            CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22,

            Add to Reading List

            Source URL: theory.stanford.edu

            Language: English - Date: 2015-01-05 12:59:35
            9An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt

            An effective technique for solving optimization problems over massive data sets is to partition the data into smaller pieces, solve the problem on each piece and compute a representative solution from it, and finally obt

            Add to Reading List

            Source URL: mmds-data.org

            Language: English - Date: 2016-06-23 15:50:48
            10Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 5, duepts) Consider Price’s model of a citation network (Chapter 14.1 of Networks), applied to

            Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 5, duepts) Consider Price’s model of a citation network (Chapter 14.1 of Networks), applied to

            Add to Reading List

            Source URL: tuvalu.santafe.edu

            Language: English - Date: 2013-11-23 11:09:29