Sciweavers

3837 search results - page 174 / 768
» Learning Approximate Consistencies
Sort
View
COCOON
2005
Springer
16 years 16 days ago
Algorithms for Terminal Steiner Trees
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
Fábio Viduani Martinez, José Coelho ...
CP
2005
Springer
16 years 16 days ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
ICANN
2005
Springer
16 years 16 days ago
A Gradient Rule for the Plasticity of a Neuron's Intrinsic Excitability
While synaptic learning mechanisms have always been a core topic of neural computation research, there has been relatively little work on intrinsic learning processes, which change...
Jochen Triesch
ESANN
2004
15 years 8 months ago
Convergence properties of a fuzzy ARTMAP network
FAMR (Fuzzy ARTMAP with Relevance factor) is a FAM (Fuzzy ARTMAP) neural network used for classification, probability estimation [3], [2], and function approximation [4]. FAMR uses...
Razvan Andonie, Lucian Sasu
ISCI
1998
139views more  ISCI 1998»
15 years 6 months ago
A Rough Set Approach to Attribute Generalization in Data Mining
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
Chien-Chung Chan