Real-time solving of computationally hard problems using optimal algorithm portfolios

Various hard real-time systems have a desired requirement which is impossible to fulfill: to solve a computationally hard optimization problem within a short and fixed amount of time T , e.g., T = 0.5 seconds. For such a task, the exact, exponential algorithms, as well as various Polynomial-Time App...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of mathematics and artificial intelligence Jg. 89; H. 7; S. 693 - 710
Hauptverfasser:	Nof, Yair, Strichman, Ofer
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.07.2021 Springer Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Combinatorial analysis Complex Systems Computation Computer Science Investment analysis Mathematics Optimization Polynomials Real time Search algorithms Algorithm portfolios NP-optimization 68T20 Real-time
ISSN:	1012-2443, 1573-7470
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!