Sciweavers

2233 search results - page 355 / 447
» On the Complexity of Theory Curbing
Sort
View
ECCC
2000
158views more  ECCC 2000»
13 years 8 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
DPD
2002
125views more  DPD 2002»
13 years 8 months ago
Parallel Mining of Outliers in Large Database
Data mining is a new, important and fast growing database application. Outlier (exception) detection is one kind of data mining, which can be applied in a variety of areas like mon...
Edward Hung, David Wai-Lok Cheung
ENTCS
2002
128views more  ENTCS 2002»
13 years 8 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
CMOT
1998
92views more  CMOT 1998»
13 years 7 months ago
SDML: A Multi-Agent Language for Organizational Modelling
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
Scott Moss, Helen Gaylard, Steve Wallis, Bruce Edm...
GRAMMARS
1998
111views more  GRAMMARS 1998»
13 years 7 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai