Search Results - • Computing methodologies → Representation of Boolean functions

Refine Results
  1. 1

    A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis by Shah, Preey, Bansal, Aman, Akshay, S., Chakraborty, Supratik

    Published: IEEE 29.06.2021
    “…Boolean Skolem function synthesis concerns syn¬thesizing outputs as Boolean functions of inputs such that a relational specification between inputs and outputs is satisfied…”
    Get full text
    Conference Proceeding
  2. 2

    Logic Synthesis for RRAM-Based In-Memory Computing by Shirinzadeh, Saeideh, Soeken, Mathias, Gaillardon, Pierre-Emmanuel, Drechsler, Rolf

    ISSN: 0278-0070, 1937-4151
    Published: IEEE 01.07.2018
    “… of the given Boolean functions throughout a level-by-level implementation methodology. It also provides alternative implementations utilizing two different logic operations…”
    Get full text
    Journal Article
  3. 3

    Computing mathematical functions with chemical reactions via stochastic logic by Solanki, Arnav, Chen, Tonglin, Riedel, Marc

    ISSN: 1932-6203, 1932-6203
    Published: United States Public Library of Science 08.05.2023
    Published in PloS one (08.05.2023)
    “…This paper presents a novel strategy for computing mathematical functions with molecular reactions, based on theory from the realm of digital design…”
    Get full text
    Journal Article
  4. 4

    On the logical structure of choice and bar induction principles by Brede, Nuria, Herbelin, Hugo

    Published: IEEE 29.06.2021
    “… approximations of functions from A to B, a generalised form GDC ABT of the axiom of dependent choice and dually a generalised bar induction principle GBI ABT…”
    Get full text
    Conference Proceeding
  5. 5

    Accuracy/Diversity and Ensemble MLP Classifier Design by Windeatt, T.

    ISSN: 1045-9227, 1941-0093
    Published: New York, NY IEEE 01.09.2006
    Published in IEEE transactions on neural networks (01.09.2006)
    “… The measure is computed between pairs of patterns on the training data and is based on a spectral representation of a Boolean function…”
    Get full text
    Journal Article
  6. 6

    The ALIGN Open-Source Analog Layout Generator: v1.0 and Beyond (Invited talk) by Dhar, Tonmoy, Kunal, Kishor, Li, Yaguang, Lin, Yishuang, Madhusudan, Meghna, Poojary, Jitesh, Sharma, Arvind K., Burns, Steven M., Harjani, Ramesh, Hu, Jiang, Mukherjee, Parijat, Yaldiz, Soner, Sapatnekar, Sachin S.

    ISSN: 1558-2434
    Published: Association on Computer Machinery 02.11.2020
    “…) it creates a unifying methodology that can be targeted to a wide range of analog circuits. The ALIGN team brings together expertise from both academic and industry researchers to create open-source software for analog layout automation…”
    Get full text
    Conference Proceeding
  7. 7

    A genetic tuning to improve the performance of Fuzzy Rule-Based Classification Systems with Interval-Valued Fuzzy Sets: Degree of ignorance and lateral position by Sanz, J., Fernández, A., Bustince, H., Herrera, F.

    ISSN: 0888-613X, 1873-4731
    Published: Amsterdam Elsevier Inc 01.09.2011
    “… However, they can suffer a lack of system accuracy as a result of the uncertainty inherent in the definition of the membership functions and the limitation of the homogeneous distribution of the linguistic labels…”
    Get full text
    Journal Article
  8. 8

    A new method for computing fuzzy functional dependencies in relational database systems by Vucetic, Miljan, Hudec, Miroslav, Vujošević, Mirko

    ISSN: 0957-4174, 1873-6793
    Published: Amsterdam Elsevier Ltd 01.06.2013
    Published in Expert systems with applications (01.06.2013)
    “…s. ► We introduce new methodology using different fuzzy implications and definition of fuzzy functional dependencies…”
    Get full text
    Journal Article
  9. 9

    Logic Synthesis for In-memory Computing Using Resistive Memories by Shirinzadeh, Saeideh, Drechsler, Rolf

    ISSN: 2159-3477
    Published: IEEE 01.07.2018
    “… customized and instruction-based. The customized approach exploits logic representations to synthesize for in-memory computing…”
    Get full text
    Conference Proceeding
  10. 10

    Improving the interoperability of industrial information systems with description logic-based models—The state of the art by Fortineau, Virginie, Paviot, Thomas, Lamouri, Samir

    ISSN: 0166-3615, 1872-6194
    Published: Kidlington Elsevier B.V 01.05.2013
    Published in Computers in industry (01.05.2013)
    “… ► We highlight limits of ontology-based languages to model PLM requirements. ► We propose research prospects involving reasoning, IS architecture and methodology…”
    Get full text
    Journal Article
  11. 11

    A hybrid SAT-based decision procedure for separation logic with uninterpreted functions by Seshia, Sanjit A., Lahiri, Shuvendu K., Bryant, Randal E.

    ISBN: 1581136889, 9781581136883
    Published: New York, NY, USA ACM 02.06.2003
    “… These decision procedures are either based on encoding atomic subformulas with Boolean variables, or by encoding integer variables as bit-vectors…”
    Get full text
    Conference Proceeding
  12. 12

    Generalized representation theorem and its application to the construction of fuzzy sets: Existence and uniqueness by Wu, Hsien-Chung

    ISSN: 0888-613X, 1873-4731
    Published: Amsterdam Elsevier Inc 01.10.2012
    “…A new methodology for constructing a fuzzy subset of a universal set U from a family of subsets of U based on a pre-determined range S that is a subset of (0,1…”
    Get full text
    Journal Article
  13. 13

    Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system by Preen, Richard J., Bull, Larry

    ISSN: 1432-7643, 1433-7479
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2014
    Published in Soft computing (Berlin, Germany) (01.01.2014)
    “…A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to neural networks…”
    Get full text
    Journal Article
  14. 14

    Formally Verified Tableau-Based Reasoners for a Description Logic by Hidalgo-Doblado, M. J., Alonso-Jiménez, J. A., Borrego-Díaz, J., Martín-Mateos, F. J., Ruiz-Reina, J. L.

    ISSN: 0168-7433, 1573-0670
    Published: Dordrecht Springer Netherlands 01.03.2014
    Published in Journal of automated reasoning (01.03.2014)
    “…Description Logics are a family of logics used to represent and reason about conceptual and terminological knowledge. One of the most basic description logics…”
    Get full text
    Journal Article
  15. 15

    EDDY: A Multi-Core BDD Package with Dynamic Memory Management and Reduced Fragmentation by Krauss, Rune, Goli, Mehran, Drechsler, Rolf

    ISBN: 9781450397834, 1450397832
    ISSN: 2153-697X
    Published: New York, NY, USA ACM 16.01.2023
    “… checking and meet time-to-market constraints. A Binary Decision Diagram (BDD) is a suitable data structure as it provides a canonical compact representation of Boolean…”
    Get full text
    Conference Proceeding
  16. 16

    Status of three classes of sequences by Gong, G., Wang, Z.L.

    ISSN: 1936-2447, 1936-2455
    Published: New York Springer US 01.03.2023
    Published in Cryptography and communications (01.03.2023)
    “…Pseudorandom sequences, sometimes shortened as sequences, have played a key role in the applications of digital communications, cryptography and computer…”
    Get full text
    Journal Article
  17. 17

    SyReC: A hardware description language for the specification and synthesis of reversible circuits by Wille, Robert, Schönborn, Eleonora, Soeken, Mathias, Drechsler, Rolf

    ISSN: 0167-9260, 1872-7522
    Published: Elsevier B.V 01.03.2016
    Published in Integration (Amsterdam) (01.03.2016)
    “… Most of the solutions proposed thus far are based on pure Boolean function representations such as truth tables or decision diagrams…”
    Get full text
    Journal Article
  18. 18

    States on EMV-algebras by Dvurečenskij, Anatolij, Zahiri, Omid

    ISSN: 1432-7643, 1433-7479
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2019
    Published in Soft computing (Berlin, Germany) (01.09.2019)
    “…We define a state as a [0, 1]-valued, finitely additive function attaining the value 1 on an EMV-algebra, which is an algebraic structure close to MV-algebras, where the top element is not assumed…”
    Get full text
    Journal Article
  19. 19

    Effects of central tendency measures on term weighting in textual information retrieval by Ghahramani, Farzad, Tahayori, Hooman, Visconti, Andrea

    ISSN: 1432-7643, 1433-7479
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2021
    Published in Soft computing (Berlin, Germany) (01.06.2021)
    “…It has become evident that term weighting has a significant effect on relevant document retrieval for which various methods are proposed. However, the main…”
    Get full text
    Journal Article
  20. 20

    Combining Boolean Games with the Power of Ontologies for Automated Multi-attribute Negotiation in the Semantic Web by Lukasiewicz, Thomas, Ragone, Azzurra

    ISBN: 0769538010, 9780769538013
    Published: Washington, DC, USA IEEE Computer Society 15.09.2009
    “… representation of utility functions, listing the utility values for all combinations of strategies…”
    Get full text
    Conference Proceeding