Sciweavers

184 search results - page 5 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
IJON
2006
103views more  IJON 2006»
13 years 7 months ago
Evolutionary system for automatically constructing and adapting radial basis function networks
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Daniel Manrique, Juan Rios, Alfonso Rodrígu...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ICTAC
2005
Springer
14 years 29 days ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
ICES
2000
Springer
140views Hardware» more  ICES 2000»
13 years 11 months ago
Evolving Cellular Automata for Self-Testing Hardware
Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but requires efficient algori...
Fulvio Corno, Matteo Sonza Reorda, Giovanni Squill...