Results 231 to 240 of about 2,261,092 (281)
Some of the next articles are maybe not open access.
2015
HANA simplifies the way we build and use enterprise systems. The integration of Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) was the first step for this simplification; the removal of predefined aggregates was the second.
Hasso Plattner, Bernd Leukert
openaire +1 more source
HANA simplifies the way we build and use enterprise systems. The integration of Online Transaction Processing (OLTP) and Online Analytical Processing (OLAP) was the first step for this simplification; the removal of predefined aggregates was the second.
Hasso Plattner, Bernd Leukert
openaire +1 more source
FTTdp: ONU Complexity Reduction
Optical Fiber Communication Conference, 2014We define and evaluate two strategies for reducing the complexity of an optical network unit deployed in a hybrid PON/DSL access network. This complexity reduction will result in reduced energy consumption and cost.
Michael P. McGarry, Elliott Gurrola
openaire +1 more source
Complexity Reduction: theory, metrics and applications
2007 IEEE International Conference on Research, Innovation and Vision for the Future, 2007Generalized Galois lattices formalism for computing contextual categorization allows metrics to evaluate complexity and efficiency as well as methods for simplifying or complicating the external object at hand. Such methods are adapted for virtual environments and augmented reality devices for which it is simple to change the distribution of features ...
Tijus, Charles +5 more
openaire +2 more sources
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
Reductive Catenation of Phosphine Antimony Complexes
Angewandte Chemie International Edition, 2015AbstractReactions of triarylphosphines with fluoroantimony(III) triflates give phosphine antimony(III) complexes, which undergo spontaneous reductive elimination of fluorophosphonium cations. The resulting phosphine antimony(I) complexes catenate to give the first examples of cationic antimony bicyclic compounds, [(R3P)4Sb6]4+, featuring a bicyclo[3.1 ...
Saurabh S. Chitnis +3 more
openaire +2 more sources
AUTOMATIC COMPLEXITY REDUCTION IN REINFORCEMENT LEARNING
Computational Intelligence, 2010High dimensionality of state representation is a major limitation for scale‐up in reinforcement learning (RL). This work derives the knowledge of complexity reduction from partial solutions and provides algorithms for automated dimension reduction in RL.
Chiu, Chung-Cheng, Soo, Von-Wun
openaire +2 more sources
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
Complexity reduction for "large image" processing
IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 2002We present a method for sampling feature vectors in large (e.g., 2000 /spl times/ 5000 /spl times/ 16 bit) images that finds subsets of pixel locations which represent c "regions" in the image. Samples are accepted by the chi-square (/spl chi//sup 2/) or divergence hypothesis test.
N R, Pal, J C, Bezdek
openaire +2 more sources
Search Space Complexity Reduction
2013Various studies have focused on exploring ways to search more efficiently; this chapter will present an overview of methods that deal with efficient searching, with a focus on methods that reduce the size of the search space. The basis of all these methods is to formulate and use constraints that trim down the search space by eliminating impossible ...
Ami Moyal +3 more
openaire +1 more source
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