Sciweavers

4217 search results - page 56 / 844
» Computational indistinguishability logic
Sort
View
ENTCS
2002
92views more  ENTCS 2002»
14 years 9 months ago
Improving the Efficiency of Non-Deterministic Computations
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
Sergio Antoy, Pascual Julián Iranzo, Bart M...
MFCS
2009
Springer
15 years 4 months ago
Size and Energy of Threshold Circuits Computing Mod Functions
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
Kei Uchizawa, Takao Nishizeki, Eiji Takimoto
ECAL
2005
Springer
15 years 3 months ago
Ant-Based Computing
We propose a biologically and physically plausible model for ants and pheromones, and show this model to be sufficiently powerful to simulate the computation of arbitrary logic cir...
Loizos Michael
EUSFLAT
2007
183views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Soft Computing in Wireless Sensors Networks
The embedded soft computing approach in wireless sensor networks is suggested. This approach means a combination of embedded fuzzy logic and neural networks models for information...
Alexey N. Averkin, A. G. Belenki

Book
397views
16 years 8 months ago
Computational Semantics with Functional Programming
"This book on applications of logic in the semantic analysis of language pays the reader the compliment of not assuming anything about what he or she knows (in particular, no...
Jan van Eijck, Christina Unger