Results 1 to 10 of about 673,074 (307)

AUTOMATIC COMPLEXITY REDUCTION IN REINFORCEMENT LEARNING

Computational Intelligence, 2010
High 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.
Von-Wun Soo
exaly   +3 more sources

Reducing the complexity of reductions

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich   +4 more
openaire   +2 more sources

REDUCTION OF STRUCTURAL COMPLEXITY

IFAC Proceedings Volumes, 1992
Abstract The identification of weakly coupled sub-systems often provides the basis for complex multi-variable control system design. Such identification is not always easy, and conventional methods of system reduction often make such an approach impossible.
Jan Jantzen, Frank Evans
openaire   +1 more source

Computational complexity reduction of GreenOFDM

Annals of Telecommunications, 2020
The GreenOFDM technique is a new SeLected Mapping Orthogonal Frequency Division Multiplexing (SLM-OFDM) scheme where the same Peak-to-Average Power Ratio (PAPR) reduction is attained at a reduced number of computed IFFTs. Indeed, for the same performance the SLM-OFDM requires computing U IFFTs while the GreenOFDM requires only $2\sqrt {U}$.
Jorge L. Gulfo Monsalve, Denis J. G. Mestdagh, Jean-Marc Brossier   +2 more
openaire   +1 more source

On the complexity of beta-reduction

Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96, 1996
We prove that the complexity of Lamping's optimal graph reduction technique for the λ-calculus can be exponential in the number of Levy's family reductions. Starting from this consideration, we propose a new measure for what could be considered as "the intrinsic complexity" of λ-terms.
openaire   +1 more source

On complexity reduction of Σ 1 formulas

Archive for Mathematical Logic, 2003
It is an important open question whether there is a constant \(q\) such that, for every \(\Sigma_1\) formula \(\varphi\) of the language of arithmetic, there is a \(\Sigma_1\) formula \(\varphi'\) with exactly \(q\) blocks of bounded quantifiers which is equivalent to \(\varphi\) over \(I\Delta_0+\lnot\exp\).
Zofia Adamowicz, Pawel Zbierski
openaire   +1 more source

FTTdp: ONU Complexity Reduction

Optical Fiber Communication Conference, 2014
We 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 I. Gurrola
openaire   +1 more source

Complexity reduction in an nRERL microprocessor

ISLPED '05. Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005., 2005
We describe an adiabatic microprocessor implemented with a reversible logic, nRERL (Lim et al., 2000). We employed an 8-phase clocked power instead of 6-phase one to reduce the number of buffers required for the phase aligning in the adiabatic microprocessor.
Seokkee Kim, Soo-Ik Chae
openaire   +1 more source

Reduction of Complexity

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