Sciweavers

4340 search results - page 532 / 868
» Formal Methods and Cryptography
Sort
View
NPL
1998
87views more  NPL 1998»
15 years 6 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
PR
1998
86views more  PR 1998»
15 years 6 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
TOPLAS
2002
116views more  TOPLAS 2002»
15 years 6 months ago
Type-preserving compilation of Featherweight Java
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
Christopher League, Zhong Shao, Valery Trifonov
ICST
2010
IEEE
15 years 5 months ago
Timed Moore Automata: Test Data Generation and Model Checking
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
Helge Löding, Jan Peleska
ISSE
2010
15 years 5 months ago
URDAD as a semi-formal approach to analysis and design
The Use Case, Responsibility Driven Analysis and Design (URDAD) methodology is a methodology for technology neutral design generating the Platform Independent Model of the Object M...
Fritz Solms, Dawid Loubser