Boolean - PDFSEARCH.IO - Document Search Engine

Boolean
Results: 2137

#	Item
821	DIO 4443 Why Diodes - Logic1 (final)_:35 Page 1 WHY DIODES – LOGIC1 Why DIODES LOGIC? Diodes Incorporated—Your Next Logic Supplier Add to Reading List Source URL: diodes.com Language: English - Date: 2014-10-30 07:48:42 Series Diode Boolean algebra Digital electronics Algebraic logic Y
822	Copyright 2003 vordenker.de This material may be freely copied and reused, provided the author and sources are cited a printable version may be obtained from Aga in Computers and the Brain * ) - HE Add to Reading List Source URL: www.vordenker.de Language: English - Date: 2007-01-12 04:52:31 Propositional calculus Semantics Philosophical logic Binary operations Boolean algebra Interpretation Truth table Many-valued logic Warren Sturgis McCulloch Logic Mathematics Science
823	/home/lwb/beta/doc/ref/ref_lwb2.dvi Add to Reading List Source URL: www.lwb.unibe.ch Language: English - Date: 2010-05-10 07:17:13 Formal languages Logical syntax Boolean algebra Well-formed formula Logical connective FO Logic Mathematical logic Propositional calculus
824	C HA PT ER 2 BASICS 2–1 Manipulating Rightmost Bits Some of the formulas in this section find application in later chapters. Use the following formula to turn off the rightmost 1-bit in a word, producing Add to Reading List Source URL: www.hackersdelight.org Language: English - Date: 2012-10-18 22:11:36 Functions and mappings Computer arithmetic Find first set Function Boolean algebra Expected value Hamming weight Mutual information Mathematics Mathematical analysis Binary arithmetic
825	ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2009-01-13 11:44:18 Information theory Randomness Philosophy of thermal and statistical physics Quantum information science Entropy Circuit Boolean circuit Fourier transform Communication complexity Theoretical computer science Applied mathematics Computational complexity theory
826	cba This is a chapter from the book System Design, Modeling, and Simulation using Ptolemy II This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License. To view a copy of this license, v Add to Reading List Source URL: ptolemy.eecs.berkeley.edu Language: English - Date: 2013-12-10 01:22:40 Boolean algebra C programming language Data types C++ Boolean data type Bitwise operation C FALSE Expression Computing Software engineering Computer programming
827	This article was downloaded by: [Chinese University of Hong Kong] On: 08 April 2013, At: 23:00 Publisher: Routledge Informa Ltd Registered in England and Wales Registered Number: [removed]Registered office: Mortimer House Add to Reading List Source URL: mentalmodels.princeton.edu Language: English - Date: 2013-04-09 12:52:39 Mathematical logic Boolean circuit Computational complexity theory Logic in computer science Boolean algebra Switch Railroad switch Reverse engineering Nonblocking minimal spanning switch Algebraic logic Theoretical computer science Mathematics
828	Complex and chaotic dynamics, basins of attraction, and memory in discrete networks∗ Andrew WUENSCHE Discrete Dynamics Lab, www.ddlab.org (Received January 11, 2010) The emergence of interacting structures in cellular Add to Reading List Source URL: uncomp.uwe.ac.uk Language: English - Date: 2010-04-16 12:00:44 Nature Chaos theory Attractor Boolean network Cellular automaton Rule 30 Dynamical system Entropy Complexity Systems Science Structure
829	Efficient searching Boolean operators Some databases and catalogues allow you to combine keywords using Boolean operators (advanced operators). Examine the effects of using Boolean operators to search for two keyword Add to Reading List Source URL: emedia.rmit.edu.au Language: English - Date: 2011-02-04 00:02:00 Wildcard character Asterisk Web search engine Computing Information science Information retrieval Pattern matching
830	Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2002-04-08 12:32:58 Mathematical logic Constraint programming Formal methods Logic in computer science Boolean algebra Boolean satisfiability problem Unit propagation Resolution Davis–Putnam algorithm Theoretical computer science Mathematics Automated theorem proving

UPDATE