"Boolean search" Essays and Research Papers

Sort By:
Satisfactory Essays
Good Essays
Better Essays
Powerful Essays
Best Essays
Page 13 of 50 - About 500 Essays
  • Powerful Essays

    Knowledge Economy”‚ Wiley VCH‚ 2005. [3] McDonald Malcolm‚ Marketing Plans (fourth edition)‚ Butterworth-Heinemann‚ 1999. [4] Radojević D.‚ “Logical aggregation based on interpolative Boolean algebra“‚ Mathware & Soft Computing‚ 15 (2008) 125 -141. [5] Radojević D.‚ “(0‚1) - valued logic: A natural generalization of Boolean logic“‚ Yugoslav Journal of operational Research‚ 10 (2000) 185 - 216. [6] Roney C. W.‚ Strategic Management Methodology‚ Praeger Publishers‚ 2004.

    Premium Strategic management Strategic business unit Logic

    • 4052 Words
    • 17 Pages
    Powerful Essays
  • Satisfactory Essays

    Sample

    • 2403 Words
    • 10 Pages

    (AB=10) Anastacia P. Ballesil (AB=11) EEE Department‚ UP Diliman‚ QC Variable Entered Mapping (VEM) Adds another dimension to the simplification power of the K-map The list of map entries will be expanded to include not only {0‚1‚x} but also Boolean variables Anastacia P. Ballesil EEE Department‚ UP Diliman‚ QC VEM Method Convert the truth table to include Map-Entered Variables (MEV’s) as output Map the new outputs to corresponding cells in the K-map Read the resulting VEM Anastacia

    Premium Truth

    • 2403 Words
    • 10 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Trumans Triangle

    • 1956 Words
    • 8 Pages

    NAME: Chibuzor Ogbu MAT NO: 030503042 COURSE: MIT 805 1. Justify by citing examples the use of Truman’s triangle in classifying technology across generations Truman’s triangle is a relationship triangle developed by Truman Reynolds that attempts to compare three attributes of a network‚ object or service. The principle behind the triangle expresses the facts that when three attributes are to be evaluated‚ the first two (randomly chosen) attributes will always disagree or not favor the last attribute

    Premium Personal computer

    • 1956 Words
    • 8 Pages
    Satisfactory Essays
  • Good Essays

    W8 Comp

    • 898 Words
    • 4 Pages

    example of a numeric constant? (Points : 5) "1" "oops" 12432 "12332" 10. (TCO 3) The relational expression must be false in order for the expression to be evaluated as true. The VBScript Boolean operator that defines this evaluation is _____. (Points : 5) math NOT OR AND 11. (TCO 3) What VBScript Boolean operator could be used to replace the nested selection structure in this pseudocode? if empMedicalIns = "Y" then if empDentalIns = "Y" then print empIdNumber‚ empLastName‚ empFirstName endif

    Premium Variable Microsoft Windows Integer

    • 898 Words
    • 4 Pages
    Good Essays
  • Good Essays

    Logic Paper

    • 681 Words
    • 3 Pages

    used Fuzzy Logic it would calculate the shades of grey that would be between the black & white and true & false. It was also said that Fuzzy Logic is similar to Boolean Logic in that Boolean Logic results are returned by Fuzzy Logic operations when all fuzzy memberships are restricted to 0 and 1. However Fuzzy Logic differs from Boolean Logic in that it is permissive of natural language queries and it is also more like human thinking. Fuzzy Logic is based more on degrees of truth. Fuzzy Logic results

    Premium Genetics Fuzzy logic Mathematics

    • 681 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Resistance of Wire

    • 766 Words
    • 4 Pages

    Factors Affecting The Resistance Of Wire Aim: To investigate the factors that affect the resistance in a conductor.   The main factors that affect the resistance in a conductor are: · Length · Temperature · Cross sectional area · Material · Magnetism The factor that we are going to change is the cross sectional area. Hypothesis: I think that the higher the cross sectional area‚ the lower the resistance in the conductor will be.   This is because the Resistance in a metal conductor happens

    Premium Electronic engineering Digital signal processing Integrated circuit

    • 766 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    physics investigatory

    • 709 Words
    • 3 Pages

    CERTIFICATE This is to certify that Mr. Abhishek Pratap Singh of Class XΙΙ has satisfactorily completed the project on “LOGIC GATES” under the guidance of Sir SHER SINGH during the session 2012-2013. VALUED BY TEACHER EXTERNAL EXAMINER DATE: PRINCIPAL ACKNOWLEDGMENT I’d like to express my greatest gratitude to the people who have helped & supported me throughout my project. I’ m grateful to our school’s PHYSICS faculty Sir SHER SINGH. For his continuous support for the project

    Premium

    • 709 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Computer Study Guide

    • 413 Words
    • 2 Pages

    text is positioned between the left and right margins. 5. Pressing the Backspace key once erases the character to the left of the insertion point. 6. A font is the general shape and style of a character. 7. AND‚ OR‚ and NOT are examples of Boolean operators. 8. Four ways of aligning test are left‚ center‚ right‚ and justify. 9. The two ways to save a file are: a) CTRL + S b) Office Button‚ Save 10. Proofreaders’ marks are symbols used to indicate changes that need to be made to

    Premium World Wide Web Website Web page

    • 413 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    heol

    • 532 Words
    • 3 Pages

    digital electronics and provide the necessary knowledge and skills required to design basic digital circuits. ECB1053 Sept 2011 ECB1053 Course Overview 4 Course Objectives     Boolean logic gates – basic building blocks of digital systems. Basic Design tools – Boolean algebra‚ Karnaugh Maps‚ Quine-McCluskey Methods Use combinational logic to design application specific system. Flip-flops‚ latches and other digital devices. ECB1053 Sept 2011 ECB1053 Course Overview

    Premium

    • 532 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    quiz 1 answer

    • 291 Words
    • 5 Pages

    properly: ab c 00 01 11 10 0 1 0 1 0 0 1 1 0 1 (b) Group the appropriate terms in the K-Map above‚ and write the minimum SOP (sum of products) expression for f. f = a’b + b’c 1 Version A 3. Using the properties of Boolean algebra we have discussed in class‚ simplify the expression from part 1(a) above. List the properties you use. Show all steps. f = a’b’c + a’bc’+ a’bc + ab’c = a’b’c + ab’c + a’bc’+ a’bc (commutative) = (a’ + a)b’c + a’b(c’ + c) (distributive)

    Premium Logic Addition

    • 291 Words
    • 5 Pages
    Satisfactory Essays
Page 1 10 11 12 13 14 15 16 17 50