Sciweavers

1486 search results - page 268 / 298
» Mathematical Fuzzy Logics
Sort
View
LACL
2001
Springer
15 years 6 months ago
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
Geoffrey K. Pullum, Barbara C. Scholz
IPPS
1998
IEEE
15 years 6 months ago
A Molecular Quasi-Random Model of Computations Applied to Evaluate Collective Intelligence
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
Tadeusz Szuba
ICCAD
1995
IEEE
88views Hardware» more  ICCAD 1995»
15 years 5 months ago
Estimation and bounding of energy consumption in burst-mode control circuits
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...
Peter A. Beerel, Kenneth Y. Yun, Steven M. Nowick,...
OWLED
2007
15 years 3 months ago
Lege Feliciter: Using Structured English to represent a Topographic Hydrology Ontology
: The mathematical nature of description logics has meant that domain experts find it hard to understand. This forms a significant impediment to the creation and adoption of ontolo...
Glen Hart, Catherine Dolbear, John Goodwin
136
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
14 years 11 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker