Results 11 to 20 of about 128,927 (292)
Analysis and practical guideline of constraint-based boolean method in genetic network inference. [PDF]
PLoS ONE, 2012 Boolean-based method, despite of its simplicity, would be a more attractive approach for inferring a network from high-throughput expression data if its effectiveness has not been limited by high false positive prediction.
Treenut Saithong +3 more
doaj +1 more source
Design Simulation System to Simplifying Boolean Equation by using Karnaugh Map [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2020 Simulation is one of most important technique used for learning, it makes learning possible without cost and provides best way to improve the practical skills for learners.
Elham Aziz
doaj +1 more source
Solving Graph Coloring Problem Based on Grover Algorithm [PDF]
Jisuanji kexue, 2023 Grover quantum search algorithm is a famous quantum algorithm designed for unstructured search problems.It can be used to solve problems such as graph coloring and shortest path sorting,and can also effectively decipher cryptosystems.Graph coloring ...
LIU Xiaonan, LIU Zhengyu, XIE Haoshan, ZHAO Chenyan
doaj +1 more source
International Journal of Mathematics and Mathematical Sciences, 2001 For an arbitrary undirected graph G, we are designing a logical model for the Hamiltonian Cycle Problem (HCP), using tools of Boolean algebra only. The obtained model is a logic formulation of the conditions for the existence of the Hamiltonian cycle ...
Anatoly D. Plotnikov
doaj +1 more source
Extracting Boolean rules from CA patterns [PDF]
, 2000 A multiobjective genetic algorithm (GA) is introduced to identify both the neighborhood and the rule set in the form of a parsimonious Boolean expression for both one- and two-dimensional cellular automata (CA). Simulation results illustrate that the new
Billings, S.A., Yang, Y.X.
core +2 more sources
Satisfiability Checking Using Boolean Expression Diagrams [PDF]
International Journal on Software Tools for Technology Transfer, 2001 In this paper we present an algorithm for determining satisfiability of general Boolean formulas which are not necessarily in conjunctive normal form. The algorithm extends the well-known Davis---Putnam algorithm to work on Boolean formulas represented using Boolean Expression Diagrams (BEDs).
Poul F. Williams +2 more
openaire +1 more source
Matrix expression of finite Boolean-type algebras [PDF]
Applied Mathematics and Computation, 2021 11 ...
Fu, Shihua +3 more
openaire +3 more sources
Construction and validation of a regulatory network for pluripotency and self-renewal of mouse embryonic stem cells. [PDF]
PLoS Computational Biology, 2014 A 30-node signed and directed network responsible for self-renewal and pluripotency of mouse embryonic stem cells (mESCs) was extracted from several ChIP-Seq and knockdown followed by expression prior studies.
Huilei Xu +4 more
doaj +1 more source
Mining TCGA data using Boolean implications.
PLoS ONE, 2014 Boolean implications (if-then rules) provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables.
Subarna Sinha +4 more
doaj +1 more source
Expressiveness and Nash Equilibrium in Iterated Boolean Games [PDF]
ACM Transactions on Computational Logic, 2021 We define and investigate a novel notion of expressiveness for temporal logics that is based on game theoretic equilibria of multi-agent systems. We use iterated Boolean games as our abstract model of multi-agent systems [Gutierrez et al. 2013, 2015a]. In such a game, each agent
Gutierrez J. +3 more
openaire +5 more sources