Results 51 to 60 of about 14,682 (204)
Improved Time Complexities for Learning Boolean Networks
Entropy, 2013 Existing algorithms for learning Boolean networks (BNs) have time complexities of at least O(N · n0:7(k+1)), where n is the number of variables, N is the number of samples and k is the number of inputs in Boolean functions.
Chee Keong Kwoh, Yun Zheng
doaj +1 more source
Tunable stochastic memristors for energy-efficient encryption and computing
Nature CommunicationsInformation security and computing, two critical technological challenges for post-digital computation, pose opposing requirements – security (encryption) requires a source of unpredictability, while computing generally requires predictability.
Kyung Seok Woo +6 more
doaj +1 more source
International Journal of Aerospace Engineering, 2018 A detailed study of a set of combined acceleration methods is presented with the objective of accelerating the solid rocket motor grain burnback simulation based on the level set method.
Ran Wei +3 more
doaj +1 more source
On Using Cutting Planes in Pseudo-Boolean Optimization
, 2006 Cutting planes are a well-known, widely used, and very eective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in Pseudo-Boolean Optimization (PBO) algorithms.
Marques-Silva, J. P. +3 more
core
Reconstructing Classical Algebras via Ternary Operations
MathematicsAlthough algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified using ternary operations.
Jorge P. Fatelo, Nelson Martins-Ferreira
doaj +1 more source
Web personalization using Extended Boolean
, 2008 The paper discusses the potential of the usage of Extended Boolean operations for personalized information delivery on the Internet based on semantic vector representation models.
Operations With Latent, Preslav Nakov
core
Boolean operations in geometry
, 2016 Educação Superior::Ciências Exatas e da Terra::MatemáticaCombine a disk and a triangle using various Boolean operations. "Ink" is filled in wherever the condition of being inside the disk, combined with the condition of being inside the triangle, is ...
Wolfram, Stephen
core +1 more source
Information and logical transformations in Schaeffer and Pierce Bases in Maple [PDF]
ITM Web of ConferencesOne of the tasks of synthesis and analysis of the functioning of combinational devices is the representation of a Boolean function in various bases. The absolute completeness of the use and implementation of various transformations of Boolean functions ...
Olenev Aleksandr +3 more
doaj +1 more source
Boolean differential operators
TURKISH JOURNAL OF MATHEMATICS, 2018 18 páginas, 1 ...
Hernández Encinas, Luis +1 more
openaire +2 more sources
Rough operations on Boolean algebras
, 2004 In this paper, we introduce two pairs of rough operations on Boolean algebras. First we define a pair of rough approximations based on a partition of the unity of a Boolean algebra.
Weiru Liu, Guilin Qi
core