Computational complexity of mathematical operations

Results: 76



#Item
1VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms

Add to Reading List

Source URL: www.vsgc.odu.edu

Language: English - Date: 2013-05-02 13:43:42
2COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used

Add to Reading List

Source URL: www.amsterdamoptimization.com

Language: English - Date: 2011-03-16 12:56:11
3CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-09-29 11:39:15
4Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨

Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:48:47
5Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:57
6CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1

CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-24 18:09:21
7CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101

CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2014-11-27 12:00:09
8Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen  Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:20
9A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2016-04-12 05:51:20
10CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete

CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-14 09:53:16