DSpace Repository

Event-threading calculation algorithm complexity estimation

Show simple item record

dc.contributor.author CHIOR, Alexandr
dc.date.accessioned 2024-01-11T08:22:06Z
dc.date.available 2024-01-11T08:22:06Z
dc.date.issued 2009
dc.identifier.citation CHIOR, Alexandr. Event-threading calculation algorithm complexity estimation. In: Microelectronics and Computer Science: proc. 6th International Conference, 1-3 Oct. 2009, Chişinău, Republica Moldova, vol. 1, 2009, pp. 233-234. ISBN 978-9975-45-045-4. ISBN 978-9975-45-122-2 (vol. 1). en_US
dc.identifier.isbn 978-9975-45-045-4
dc.identifier.isbn 978-9975-45-122-2
dc.identifier.uri http://repository.utm.md/handle/5014/25777
dc.description.abstract In this paper it is considered a new variant of artificial neural network (ANN) and calculation algorithm so-called event-threading ANN. The classical model of ANN is enhanced by introducing the notion of event-threading that allows decreasing computational complexity from O(n) down to O(ln n). en_US
dc.language.iso en en_US
dc.publisher Technical University of Moldova en_US
dc.relation.ispartof Proceeding of the 6th International Conference on "Microelectronics and Computer Science", oct.1-3, 2009, Chişinău, Moldova
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject event-threading en_US
dc.subject artificial neural networks (ANN) en_US
dc.subject algorithms en_US
dc.subject associative memories en_US
dc.title Event-threading calculation algorithm complexity estimation en_US
dc.type Article en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account