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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of mathematics and artificial intelligence Ročník 89; číslo 7; s. 693 - 710
Hlavní autori:	Nof, Yair, Strichman, Ofer
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.07.2021 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!