Sciweavers

4036 search results - page 448 / 808
» Formal Methods
Sort
View
IJON
2008
133views more  IJON 2008»
15 years 5 months ago
A multi-objective approach to RBF network learning
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
Illya Kokshenev, Antônio de Pádua Bra...
LDTA
2010
15 years 7 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
TKDE
2012
192views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Discriminative Feature Selection by Nonparametric Bayes Error Minimization
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
Shuang-Hong Yang, Bao-Gang Hu
ISCAS
2008
IEEE
119views Hardware» more  ISCAS 2008»
16 years 1 months ago
Adjusting the neurons models in neuromimetic ICs using the voltage-clamp technique
— This paper presents an original method to tune a neuromimetic IC based on neuron conductance-based models (Hodgkin-Huxley formalism). This method is well known in electrophysio...
Sylvain Saïghi, Laure Buhry, Yannick Bornat, ...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
15 years 5 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...