Anytime Algorithms for GPU Architectures

Most algorithms are run-to-completion and provide one answer upon completion and no answer if interrupted before completion. On the other hand, anytime algorithms have a monotonic increasing utility with the length of execution time. Our investigation focuses on the development of time-bounded anyti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Mangharam, R., Saba, A. A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Arrays Graphics processing unit Kernel Runtime Vehicles
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!