Results 261 to 270 of about 11,871 (292)
Some of the next articles are maybe not open access.
Resolving, resolving ... resolved!
2016The recombination outcomes of resolution of Double Holliday Junctions (DHJs) divided by a large heterologous insertion were presented and contemplated.
openaire
Discrete Applied Mathematics, 2019
In the paper under review, the author introduces a new class of configurations called resolvable. An incidence structure \(\mathcal{S}\) is an ordered triple \(\mathcal{S} = (\mathcal{P},\mathcal{B},I)\) of mutually disjoint sets such that \(\mathcal{P}\) is the set of points, \(\mathcal{B}\) is the set of blocks, and \(I \subseteq \mathcal{P} \times ...
openaire +3 more sources
In the paper under review, the author introduces a new class of configurations called resolvable. An incidence structure \(\mathcal{S}\) is an ordered triple \(\mathcal{S} = (\mathcal{P},\mathcal{B},I)\) of mutually disjoint sets such that \(\mathcal{P}\) is the set of points, \(\mathcal{B}\) is the set of blocks, and \(I \subseteq \mathcal{P} \times ...
openaire +3 more sources
To Resolve or not to Resolve? that is the Big Question About Confusion
2015Positive relationships between confusion and learning have been found for the last decade. Most theoretical foundations for confusion hypothesize that it is not the mere occurrence of confusion, but rather the successful resolution that benefits learning.
Blair Lehman, Arthur C. Graesser
openaire +1 more source
2005
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified variables and eliminate universal variables by expansion. This process is continued until the formula becomes propositional and can be solved by any SAT solver. On structured
openaire +2 more sources
We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified variables and eliminate universal variables by expansion. This process is continued until the formula becomes propositional and can be solved by any SAT solver. On structured
openaire +2 more sources
Characterization of Compactness for Resolvents and Its Applications
Applied Mathematics and Computation, 2014Zhenbin Fan
exaly