Sciweavers

2905 search results - page 185 / 581
» Formal Memetic Algorithms
Sort
View
EUSFLAT
2003
122views Fuzzy Logic» more  EUSFLAT 2003»
13 years 11 months ago
Structure recognition on sequences with a neuro-fuzzy-system
We present a formal description of a neurofuzzy system capable of aligning two sequences recognizing their internal structure. The alignment is done on two levels: grouping of the...
Klaus Dalinghaus, Tillman Weyde
COLING
1996
13 years 11 months ago
Processing Metonymy- a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
Jacques Bouaud, Bruno Bachimont, Pierre Zweigenbau...
COLING
1992
13 years 11 months ago
A Treatment Of Negative Descriptions Of Typed Feature Structures
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
Kiyoshi Kogure
ICML
2010
IEEE
13 years 11 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 10 months ago
Effective Complexity and its Relation to Logical Depth
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
Nihat Ay, Markus Mueller, Arleta Szkola