Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Novel Principles and Methods for Computing with Attractors
Authors: Horia-Nicolai Teodorescu, Daniel Mlynek, Abraham Kandel
– 0.29 Mb
Abstract
We briefly analyze several issues related to the "computing with attractors" domain. We present a point of view on the topic and several new concepts, methods, and techniques for computing with attractors. We discuss applications where this method may prove useful. We answer several questions related to the usefulness of this computing paradigm.H.-N. Teodorescu, D. Mlynek, A. Kandel,
Horia-Nicolai Teodorescu,
Technical University of Iasi,
Romania,
Institute of Information Science,
Romanian Academy,
Daniel Mlynek,
Swiss Federal Institute of Technology,
Lausanne, Switzerland
Abraham Kandel,
University of South Florida,
Tampa, USA
Horia-Nicolai Teodorescu,
Technical University of Iasi,
Romania,
Institute of Information Science,
Romanian Academy,
Daniel Mlynek,
Swiss Federal Institute of Technology,
Lausanne, Switzerland
Abraham Kandel,
University of South Florida,
Tampa, USA
Fulltext
– 0.29 Mb
Contents
- Gaindric Constantin Victorovich (A tribute in honor of his 60th birthday)
- A cybernetic model of computerization of the cultural heritage
- Novel Principles and Methods for Computing with Attractors
- On P Systems with Membrane Creation
- Computer support of group decision making
- Confluent-Functional solving systems
- Collective expertise through the prism of network Technologies
- J. Piaget's theory of intelligence: operational aspect
- An efficient algorithm for mining interesting set-valued rules
- Lower and upper chromatic numbers for BSTSs(2h - 1)
