Results 271 to 280 of about 673,074 (307)
Some of the next articles are maybe not open access.
2012
As mentioned before, in comparative politics at the macro-level the “many variables — small N” situation prevails (see also Chapter 3 in this book). In such a situation an analysis suffers from “over-determination”, that is, more distinct causal relationships cannot be established when there are more variables than cases (Przeworski and Teune 1970: 23).
openaire +1 more source
As mentioned before, in comparative politics at the macro-level the “many variables — small N” situation prevails (see also Chapter 3 in this book). In such a situation an analysis suffers from “over-determination”, that is, more distinct causal relationships cannot be established when there are more variables than cases (Przeworski and Teune 1970: 23).
openaire +1 more source
About Segment Complexity of Turing Reductions
Mathematical Logic Quarterly, 1999AbstractWe apply complexity concepts to define a new sort of sub‐Turing reducibilities ≤ 𝔷 make the degree hierarchy thinner and to obtain some new specifications of the well known jump inversion theorem of Friedberg. We show that this theorem doesn't hold when ≤ T is replaced with ≤ 𝔷, where 𝔷 is any countable subset of the class 𝔷 of all total ...
openaire +1 more source
Association Reducts: Complexity and Heuristics
2006We investigate association reducts, which extend previously studied information and decision reducts in capability of expressing dependencies between groups of attributes in data. We formulate optimization problems related to the most informative associations between groups of attributes.
openaire +1 more source
REDUCTION BY ORGANOMETALLIC COMPLEXES
1962Abstract : Solutions of azobenzene (.01 M) and tricarbonylarenechromiums (.01 M) , RC6H5(CO)3, in dulute ethanolic hydrochloric acid (.01 M) under N give fair yields (up to 30%) of benzidine dihydrochloride, identified by analysis and I.R. spectrum. The reaction occurs for the substituent range R=Me,CL,H,NH2,NHMe and NMe2 and is facilitated by electron
H. SLOAN, J.P. HARGADEN, DAVID A. BROWN
openaire +1 more source
Reduction of the Controller Complexity
2016Controller complexity reduction is an issue in many applications. The key objectives of controller complexity reduction is to obtain a reduced order controller which preserves the closed-loop properties of the nominal closed-loop system (stability, robustness, performance).
Ioan Doré Landau +3 more
openaire +1 more source
Reduction of Computational Complexity
2015If a naive method is employed to implement the APA, the number of arithmetic operations per sample is approximately given by a polynomial \(\alpha p^{3} + \beta np^{2}\), where \(\alpha \) and \(\beta \) are positive coefficients, n is the filter length, and p is the projection order.
openaire +1 more source
Emission reduction target, complexity and industrial performance
Journal of Environmental Management, 2020Zhaoyingzi Dong, Shaojian Wang
exaly
Complexity Measures and Reductions
1999Suppose we are given two binary strings, each consisting of n bits, a = a n−1 a n−2 ... a 0, and b = b n−1 b n−2 ... b 0. We want to solve the following problem: Interpret a and b as binary representations of two natural numbers and compute their sum (again in binary). We refer to this problem as ADD.
openaire +1 more source