Boolean

Results: 2137



#Item
581

Recent Results on Ordering Parameters in Boolean Networks Jürgen Klüver Jörn Schmidt University of Duisburg-Essen, FB2,

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:37:04
    582Operations research / Constraint programming / Electronic design automation / Formal methods / NP-complete problems / Satisfiability Modulo Theories / Mathematical optimization / Linear programming / Boolean satisfiability problem / Theoretical computer science / Applied mathematics / Mathematics

    νZ - An Optimizing SMT Solver Nikolaj Bjørner1 , Anh-Dung Phan2 , and Lars Fleckenstein3 1 Microsoft Research, Redmond, WA, USA DTU Compute, Technical University of Denmark

    Add to Reading List

    Source URL: research.microsoft.com

    Language: English - Date: 2015-01-22 06:10:53
    583Software engineering / Local consistency / Multiset / Boolean satisfiability problem / Cardinality / Decomposition method / Linear programming relaxation / Constraint programming / Theoretical computer science / Mathematics

    Disjoint, Partition and Intersection Constraints for Set and Multiset Variables    

    Add to Reading List

    Source URL: homepages.laas.fr

    Language: English - Date: 2010-11-22 06:22:29
    584Science / Gene expression / Molecular biology / Systems biology / Gene regulatory network / Boolean network / Boolean function / Bayesian network / Gene / Biology / Boolean algebra / Networks

    Temporal Boolean Network Models of Genetic Networks and their Inference from Gene Expression Time Series

    Add to Reading List

    Source URL: www.complex-systems.com

    Language: English - Date: 2012-09-20 14:36:17
    585Polygons / Euclidean plane geometry / 3D computer graphics / Simple polygon / PSPACE-complete / Vertex / Hex / True quantified Boolean formula / Polyhedron / Games / Geometry / Theoretical computer science

    CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Partial Searchlight Scheduling is Strongly PSPACE-Complete Giovanni Viglietta∗ Abstract

    Add to Reading List

    Source URL: www.cccg.ca

    Language: English - Date: 2013-08-11 21:51:56
    586Boolean algebra / Cross-platform software / Diagrams / Binary decision diagram / Model checking / Cellular automaton / Java / Lookup table / C / Computing / Computer programming / Software engineering

    Translations of Cellular Automata for Efficient Simulation

    Add to Reading List

    Source URL: www.complex-systems.com

    Language: English - Date: 2012-09-20 14:36:39
    587Notation / Procedural programming languages / For loop / While loop / C / Boolean data type / Computing / Software engineering / Control flow

    JAVA - LOOP CONTROL http://www.tutorialspoint.com/java/java_loop_control.htm Copyright © tutorials point.com There may be a sit uat ion when we need t o execut e a block of code several number of t imes, and is

    Add to Reading List

    Source URL: www.tutorialspoint.com

    Language: English - Date: 2015-04-27 04:48:22
    588Logical truth / Binary operations / Boolean algebra / Tautology / Logical connective / If and only if / Entailment / Well-formed formula / Truth table / Logic / Propositional calculus / Philosophical logic

    Propositional Logic Review John MacFarlane January 24, 2011 The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula. Semantics Defining truth in a model (and, derivativel

    Add to Reading List

    Source URL: johnmacfarlane.net

    Language: English - Date: 2011-01-24 19:35:06
    589Complexity classes / True quantified Boolean formula / NL / Reversible computing / PSPACE-complete / PP / DSPACE / IP / Computation / Theoretical computer science / Computational complexity theory / Applied mathematics

    Space and energy efficient computation with DNA strand displacement systems Chris Thachuk and Anne Condon Department of Computer Science, University of British Columbia, Vancouver, BC, Canada Abstract. Chemical reaction

    Add to Reading List

    Source URL: www-devel.cs.ubc.ca

    Language: English - Date: 2012-06-17 22:22:27
    590Integer sequences / Algebra / Polynomials / FO / Computational complexity theory / Prime number / Primality test / Square-free integer / Irreducible polynomial / Mathematics / Theoretical computer science / Complexity classes

    Boolean Decision Functions Steven Finch April 22, 2015 Let  : {0 1} → {0 1} be the Boolean function that decides whether a given ( + 1)-bit odd integer is square-free. More precisely, ½

    Add to Reading List

    Source URL: www.people.fas.harvard.edu

    Language: English - Date: 2015-04-21 10:31:24
    UPDATE