ITHEA Classification Structure > F. Theory of Computation > F.1 COMPUTATION BY ABSTRACT DEVICES > F.1.1 Models of Computation
STATIC ANALYSIS OF USEFULNESS STATES IN TRANSITION P SYSTEMS
By: Frutos et al. (3259 reads)
Rating:
(1.00/10)
article:
ALGORITHMIZATION PROCESS FOR FRACTAL ANALYSIS IN THE CHAOTIC DYNAMICS OF ...
· INTELLIGENT TRADING SYSTEMS
· AN ARCHITECTURE FOR REPRESENTING BIOLOGICAL PROCESSES BASED ON NETWORKS...
· Polynomial Regression using a Perceptron with Axo-axonic Connections
· ACCOUNTING IN THEORETICAL GENETICS
· A NEW METHOD FOR THE BINARY ENCODING AND HARDWARE IMPLEMENTATION OF METABOLIC P
· GENETIC BASED SPOT DETECTION METHOD IN TWO-DIMENSIONAL ELECTROPHORESIS IMAGES
· Self-Organizing Architectural design based on Morphogenetic Programming
· PRION CRYSTALIZATION MODEL AND ITS APPLICATION TO RECOGNITION PATTERN
· POLYNOMIAL APPROXIMATION USING PARTICLE SWARM OPTIMIZATION OF LINEAR ...
· MULTIPLE-MODEL DESCRIPTION AND STRUCTURE DYNAMICS ANALYSIS OF ACTIVE MOVING...
· COMPUTATIONAL MODEL FOR SERENDIPITY
· STRING MEASURE APPLIED TO STRING SELF-ORGANIZING MAPS AND NETWORKS OF ...
· CLASSIFICATION OF DATA TO EXTRACT KNOWLEDGE FROM NEURAL NETWORKS
· SIMULTANEOUS CONTROL OF CHAOTIC SYSTEMS USING RBF NETWORKS
· TIMED TRANSITION AUTOMATA AS NUMERICAL PLANNING DOMAIN
· STATIC ANALYSIS OF USEFULNESS STATES IN TRANSITION P SYSTEMS
· GENERALIZING OF NEURAL NETS: FUNCTIONAL NETS OF SPECIAL TYPE
· AUTOMATA–BASED METHOD FOR SOLVING SYSTEMS OF LINEAR CONSTRAINTS IN {0,1}
· FILTERED NETWORKS OF EVOLUTIONARY PROCESSORS*
· NEURAL CONTROL OF CHAOS AND APLICATIONS
· SOLVING A DIRECT MARKETING PROBLEM BY THREE TYPES OF ARTMAP NEURAL NETWORKS
· |
Login World Clock |

[ Execution time: 0.08 secs ] [ Memory usage: 7.55MB ] [ GZIP Disabled ] [ Server load: 0.31 ]

Powered by Tikiwiki CMS/Groupware