Hochschulschrift
Optimization of NP-hard Scheduling Problems by Developing Timing Algorithms and Parallelization
- Weitere Titel
-
Optimierung von NP-Schweren Scheduling-Problemen durch die Entwicklung von Timing-Algorithmen und Parallelisierung
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Oldenburg, Universität Oldenburg, Dissertation, 2016
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Oldenburg
- (wer)
-
BIS der Universität Oldenburg
- (wann)
-
2016
- Urheber
-
Awasthi, Abhishek
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:gbv:715-oops-29969
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Awasthi, Abhishek
- Kramer, Oliver
- Lässig, Jörg
- BIS der Universität Oldenburg
Entstanden
- 2016
Ähnliche Objekte (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