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

Full description

Saved in:

Bibliographic Details
Published in:	Annals of mathematics and artificial intelligence Vol. 89; no. 7; pp. 693 - 710
Main Authors:	Nof, Yair, Strichman, Ofer
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.07.2021 Springer Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!