Finite State Machines
Mostrando 13-19 de 19 artigos, teses e dissertações.
-
13. Sintese de controladores para transitorios em escalonamento de job shop ciclico
A cyclic scheduling is a sequence of tasks, infinitely repeated by a set of machines. Cyclic scheduling arises in job-shop problems whenever several products are regularly produced at the same rate, with setup cost and time negletable. A steady-state solution for this problem is assumed to be known. We also assume that the system is subject to disturbances (
Publicado em: 2000
-
14. Coevolução de agentes de estado finito / Coevolution of finite state agents
This work is concerned on the study of evolutionary algorithms, in the solution of problems involving coevolution of agents, whose behavior correspond to finite state machines. The genetic algorithms are the base for the coevolutive process, approaching cooperative and competitive behaviors. The cooperation happens inside of a specific group of agents and th
Publicado em: 1999
-
15. A Coverification Framework
In dieser Dissertation wird eine Koverifikations-Umgebung (coverification fra-mework CVF) präsentiert. CVF ist geeignet für die Validierung von Systemen die aus Hardware und Software bestehen. Das Werkzeug profitiert von der partitionierten Natur der HW/SW-Systeme, da die Eigenschaften der Systeme modular verifiziert werden. Die Modellprüfung (model check
Publicado em: 1999
-
16. ELEMENTO DE CHAVEAMENTO PARA REDES DE INTERCONEXÃO MULTI-ESTÁGIO DE MÁQUINAS MULTIMICROPROCESSADAS / INTERCONNECTION ELEMENT FOR A PARALLEL PROCESSING SYSTEM
This work proposes a new structure of interconnection network for the MULTIPLUS, a parallel processing system under development at NCE/UFRJ. The network is fault tolerant, and works with 4 inputs and 4 outputs switches. Initially, some interconnection forms of parallel machines are discussed. Some parallel systems architecture are briefly described with emph
Publicado em: 1994
-
17. Chemical implementation of finite-state machines.
With methods developed in a prior article on the chemical kinetic implementation of a McCulloch-Pitts neuron, connections among neurons, logic gates, and a clocking mechanism, we construct examples of clocked finite-state machines. These machines include a binary decoder, a binary adder, and a stack memory. An example of the operation of the binary adder is
-
18. Electrical addressing of confined quantum systems for quasiclassical computation and finite state logic machines
Conduction spectroscopy measures the current I through a nanosystem as a function of the voltage V between two electrodes. The differential conductance, dI/dV, has peaks that can be assigned to resonance conditions with different electronic levels of the system. Between these increments, the current has roughly constant plateaus. We discuss how measurements
National Academy of Sciences.
-
19. Chemical implementation of neural networks and Turing machines.
We propose a reversible reaction mechanism with a single stationary state in which certain concentrations assume either high or low values dependent on the concentration of a catalyst. The properties of this mechanism are those of a McCulloch-Pitts neuron. We suggest a mechanism of interneuronal connections in which the stationary state of a chemical neuron