Autores
Retchkiman Konigsberg Mordejai Zvi
Título Computability and stability for hybrid algorithms
Tipo Congreso
Sub-tipo Memoria
Descripción 10th International Conference on Swarm Intelligence, ICSI 2019
Resumen Church’s Thesis for discrete algorithms motivates an analogous thesis for dealing with analog algorithms. Specifically, the notions of analog algorithm and dynamical system are postulated to be equivalent. Stability for hybrid algorithms is addressed by considering Lyapunov energy functions for analog algorithms with continuous and discontinuous states.
Observaciones DOI 10.1007/978-3-030-26369-0_37 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) v. 11655
Lugar Chiang Mai
País Tailandia
No. de páginas 395-401
Vol. / Cap. 11655 LNCS
Inicio 2019-07-26
Fin 2019-07-30
ISBN/ISSN 9783030263683