نتایج جستجو برای: average run length arl
تعداد نتایج: 757253 فیلتر نتایج به سال:
Process monitoring through control charts is a quite popular practice in statistical process control. This study is planned for monitoring the process dispersion parameter using exponentially weighted moving average (EWMA) control chart scheme. Most of the EWMA dispersion charts that have been proposed are based on the assumption that the parent distribution of the quality characteristic is nor...
Real-time delivery of products in the context of stochastic demands and multiple vehicles is a difficult problem, as it requires the joint investigation of the problems in inventory control and vehicle routing. We model this problem in the framework of Average-reward Reinforcement Learning (ARL) and present experimental results on a modelbased ARL algorithm called H-Learning with piecewise line...
To study the design, control and energetics of autonomous dynamically stable legged machines we have built a planar one-legged robot, the ARL Monopod. Its top running speed of 4.3 km/h (1.2 m/s) makes it the fastest electrically actuated legged robot to date. We adapted Raibert's control laws for the low power electric actuation necessary for autonomous locomotion and performed a detailed energ...
The ADP-ribosylation factor (ARF) family is one of four subfamilies of the RAS superfamily of low molecular weight GTP-binding proteins (G proteins). Highly degenerate oligonucleotides encoding two conserved regions were used in a PCR reaction to amplify cDNAs encoding each of the known ARF proteins and eight additional cDNA fragments encoding previously unreported human members of the ARF fami...
The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their bitsizes. While within constant factors from their traditional counterparts for their worst case behavior, our arithmetic operations open the doors for inte...
We consider the problem of restructuring compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string T produced by any grammar-based compression algorithm, to representations produced by several specific compression algorithms including LZ77, LZ78, run length encoding, and some grammar based compression algorithms. T...
This paper presents a pipeline algorithm for MPI Reduce that uses a Run Length Encoding (RLE) scheme to improve the global reduction of sparse floating-point data. The RLE scheme is directly incorporated into the reduction process and causes only low overheads in the worst case. The high throughput of the RLE scheme allows performance improvements when using high performance interconnects, too....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید