نتایج جستجو برای: time q

تعداد نتایج: 1991485  

2015
Yunsick Sung

In this paper, an update method of Q-value is proposed to increase the learning rate of Q-learning. When Q-value of executed action is small, even if it is an optimal action, the learning becomes longer because the frequency to be executed again becomes lower. The proposed method increased the execution frequency of optimal action by forcefully increasing the Q-value through the Q-value update ...

2004
Salam A. Zummo

I-Q ST codes have shown the potential to provide high coding gains in rapid fading environments. The optimal decoding of I-Q ST codes involves the use of the super-trellis of the I and Q codes, which is complex in general. This paper proposes two iterative decoding algorithms for I-Q ST codes. The proposed algorithms have similar performance to optimal decoding with much lower complexity.

2004
Y. Han O. Boyraz A. Nuruzzaman B. Jalali

We propose and demonstrate the time stretch optical header recognition technique where a high speed header is extracted and slowed down by more than an order of magnitude, in optical domain, to facilitate the capture and processing in electronic domain. The technique can be implemented in continuous time or discrete time. Both implementations are experimentally demonstrated for stretching a 10 ...

2001
Bir Bhanu Pat Leang Chris Cowden Yingqiang Lin Mark Patterson

This paper presents the design, implementation and testing of a real-time system using computer vision and machine learning techniques to demonstrate learning behavior in a miniature mobile robot. The miniature robot, through environmental sensing, learns to navigate a maze choosing the optimum route. Several reinforcement learning based algorithms, such as Q-learning, Q(λ)-learning , fast onli...

2015
Martin Matzner Moritz von Hoffen Tobias Heide Florian Plenter Friedrich Chasin

Information System Design (ISD) applies information technology to achieve desired ends in organizations and implies many technology choices to be made. A successful design of information systems addresses the different views of all its stakeholders in these decisions. If we consider that sub-part of an IS that is intended to assist in customer processes, a purposeful assessment of the preferenc...

Journal: :JSW 2013
Jingling Yuan Xuyang Miao Lin Li Xing Jiang

In order to reduce energy consumption of data centers while employing infrastructure resource effectively, a comprehensive resource management method using an improved online energy saving mapping algorithm for virtual machines of data centers is proposed. An intelligent feedback management framework is built for online resource optimization. We propose reinforcement learning and threshold base...

Arun K. Srivastava Rana Noor, Sheo Kumar Singh

We study here $T_{0}$-$Q$-bitopological spaces and sober $Q$-bitopological spaces and their relationship with two particular Sierpinski objects in the category of $Q$-bitopological spaces. The epireflective hulls of both these Sierpinski objects in the category of $Q$-bitopological spaces turn out to be the category of $T_0$-$Q$-bitopological spaces. We show that only one of these Sierpinski ob...

Journal: :Physica D: Nonlinear Phenomena 2021

We study the initial value problem for integrable nonlocal nonlinear Schr\"odinger (NNLS) equation \[ iq_{t}(x,t)+q_{xx}(x,t)+2 q^{2}(x,t)\bar{q}(-x,t)=0 \] with symmetric boundary conditions: $q(x,t)\to Ae^{2iA^2t}$ as $x\to\pm\infty$, where $A>0$ is an arbitrary constant. describe asymptotic stage of modulation instability NNLS by computing large-time asymptotics solution $q(x,t)$ this proble...

Journal: :IACR Cryptology ePrint Archive 2009
Alex Biryukov Dmitry Khovratovich Ivica Nikolic

In this paper we construct a chosen-key distinguisher and a related-key attack on the full 256-bit key AES. We define a notion of differential q-multicollision and show that for AES-256 q-multicollisions can be constructed in time q ·2 and with negligible memory, while we prove that the same task for an ideal cipher of the same block size would require at least O(q · 2 q−1 q+1 ) time. Using sim...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید