Partition

Results: 2124



#Item
101Overview of Generating Functions October 26, 2015 A function associated to a sequence a0 , a1 , a2 , . . . Two Types 1. Ordinary generating functions

Overview of Generating Functions October 26, 2015 A function associated to a sequence a0 , a1 , a2 , . . . Two Types 1. Ordinary generating functions

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:55
102System 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
103Using the channel profile analysis tool, built by the University of Edinburgh Land Surface Dynamics group

Using the channel profile analysis tool, built by the University of Edinburgh Land Surface Dynamics group

Add to Reading List

Source URL: csdms.colorado.edu

Language: English - Date: 2013-09-06 09:54:59
104The 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
105APPLICATIONS OF LATTICE THEORY TO AUTOMATED CODING AND DECODING Lawrence H. Cox

APPLICATIONS OF LATTICE THEORY TO AUTOMATED CODING AND DECODING Lawrence H. Cox

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-29 22:42:09
106CS264: 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
107XtratuM hypervisor Alfons Crespo Jon Pérez (IK4-Ikerlan) Berlin Nov. 4th

XtratuM hypervisor Alfons Crespo Jon Pérez (IK4-Ikerlan) Berlin Nov. 4th

Add to Reading List

Source URL: 138.4.11.199

Language: English - Date: 2015-01-11 06:54:50
108An 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
109Algebra / Mathematics / Linear algebra / Similarity / Equivalence class / Matrix / Rank / Equivalence of categories / Euclidean vector / Partition of a set / Equivalence relation

7 POSITIONS Ideas of social role have been important to social theorists since the middle of the century. Social networks provide an ideal environment in which to formalise the theoretical concepts of role and position.

Add to Reading List

Source URL: www.analytictech.com

Language: English - Date: 2015-10-12 19:12:55
110Red Hat Enterprise Linux 5.2 Red Hat Enterprise Linux Installation Guide 5.2 ISBN: N/A

Red Hat Enterprise Linux 5.2 Red Hat Enterprise Linux Installation Guide 5.2 ISBN: N/A

Add to Reading List

Source URL: centos.org

Language: English - Date: 2008-05-21 18:21:59