Silvana Petruseva

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network(More)
  • 1