Hochschulschrift
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
- Alternative title
-
Optimierung von NP-Schweren Scheduling-Problemen durch die Entwicklung von Timing-Algorithmen und Parallelisierung
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Oldenburg, Universität Oldenburg, Dissertation, 2016
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Oldenburg
- (who)
-
BIS der Universität Oldenburg
- (when)
-
2016
- Creator
-
Awasthi, Abhishek
- Contributor
- URN
-
urn:nbn:de:gbv:715-oops-29969
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:42 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Awasthi, Abhishek
- Kramer, Oliver
- Lässig, Jörg
- BIS der Universität Oldenburg
Time of origin
- 2016
Other Objects (12)
Scheduling algorithms and timing analysis for hard real-time systems
Timing analysis, scheduling, and allocation of periodic hard real-time tasks
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Static timing analysis for hard real-time systems
Energy efficient scheduling for hard real-time systems
Scheduling algorithms and timing analysis for hard real-time systems
Timing analysis, scheduling, and allocation of periodic hard real-time tasks
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Static timing analysis for hard real-time systems
Energy efficient scheduling for hard real-time systems
Scheduling algorithms and timing analysis for hard real-time systems
Timing analysis, scheduling, and allocation of periodic hard real-time tasks
Automating Resolution is NP-Hard
Robust Geometric Programming is co-NP hard
NP-hard networking problems : exact and approximate algorithms
Leveraging Path Structures in NP-hard Graph Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
Deadlock-Detection in Component-Based Systems is NP-hard.
Deciding Liveness in Component-Based Systems is NP-hard
Novel Machine Learning Algorithms for NP-hard Combinatorial Problems
Static timing analysis for hard real-time systems