1![Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg | yi}@it.uu.se Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg | yi}@it.uu.se](https://www.pdfsearch.io/img/07fe8f2ecbce410b290ee5f51edc77f9.jpg) | Add to Reading ListSource URL: user.it.uu.seLanguage: English - Date: 2017-12-22 08:57:43
|
---|
2![New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc New Set of Codes for the Maximum-Likelihood Decoding Problem M. Barbier Abstract The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduc](https://www.pdfsearch.io/img/323ff1a74470d281437ec40bc5b3e51c.jpg) | Add to Reading ListSource URL: barbierm01.users.greyc.frLanguage: English - Date: 2012-09-14 10:31:23
|
---|
3![Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample](https://www.pdfsearch.io/img/e2c70730e69d2ba45588c7c0ffd712cb.jpg) | Add to Reading ListSource URL: arvanzuijlen.people.wm.edu- Date: 2009-07-13 21:26:58
|
---|
4![Polynomial-time special cases of NP-hard problems Polynomial-time special cases of NP-hard problems](https://www.pdfsearch.io/img/412f2ee173db7a2965dfe38b2d717b20.jpg) | Add to Reading ListSource URL: zoo.cs.yale.edu- Date: 2008-09-23 14:07:34
|
---|
5![Minimum Bisection is NP-hard on Unit Disk Graphs Josep D´ıaz1 and George B. Mertzios2∗ 1 2 Minimum Bisection is NP-hard on Unit Disk Graphs Josep D´ıaz1 and George B. Mertzios2∗ 1 2](https://www.pdfsearch.io/img/bce7851d9e569181ff6b26bbd3a9ddf0.jpg) | Add to Reading ListSource URL: community.dur.ac.uk- Date: 2014-06-10 13:22:30
|
---|
6![Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann∗ Tobias Friedrich† Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann∗ Tobias Friedrich†](https://www.pdfsearch.io/img/bd3fb6733fe8930b5cadec4811270eaf.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.de- Date: 2016-01-03 06:48:03
|
---|
7![A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012](https://www.pdfsearch.io/img/90206d6500daeb17e84756c1ecf7b058.jpg) | Add to Reading ListSource URL: www.daviddelaat.nlLanguage: English |
---|
8![TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems](https://www.pdfsearch.io/img/a56ab4d0f3f00c686acc9c6b2ae0be4e.jpg) | Add to Reading ListSource URL: www.ads.tuwien.ac.atLanguage: English - Date: 2015-02-11 08:09:39
|
---|
9![Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1](https://www.pdfsearch.io/img/df659750d7f73d539655c7d628103700.jpg) | Add to Reading ListSource URL: people.mpi-inf.mpg.deLanguage: English - Date: 2016-01-03 06:48:33
|
---|
10![LNCSA Standard Framework for Timetabling Problems LNCSA Standard Framework for Timetabling Problems](https://www.pdfsearch.io/img/fae986925fd2dabecaf01ad6cdfce480.jpg) | Add to Reading ListSource URL: stefan.buettcher.orgLanguage: English - Date: 2006-04-07 00:52:14
|
---|