Method look-up for dynamically typed object-oriented languages, such as SMALLTALK-80 or OBJECTIVE-C, is usually implemented by a cached inheritance search. Unfortunately, this technique is slow. A selector-indexed dispatch table implementation speeds up messages to within 10% of the speed of a statically typed language such as C++. We present a fast technique for generating compact selector-ind...

Data representations for LDPC decoders using the sum-product algorithm in the log-likelihood domain are considered. It is suggested that the look-up table implementation of the domain transform function is separated into two parts, allowing a compact representation of the internal state data. Memories and bus widths can be reduced by typically 16%, while the imposed hardware overhead is insigni...

In this note we characterize the compact weighted Frobenius-Perron operator $p$ on $L^1(Sigma)$ and determine their spectra. We also show that every weakly compact weighted Frobenius-Perron operator on $L^1(Sigma)$ is compact.

in this paper, a complete description concerning linear operators of banach spaces with range in lipschitz algebras $lip_al(x)$ is provided. necessary and sufficient conditions are established to ensure boundedness and (weak) compactness of these operators. finally, a lower bound for the essential norm of such operators is obtained.

the purpose of this paper is to introduce the concept of pairwise f-closedness in bitopological spaces. this space contains both of pairwise strongcompactness and pairwise s-closedness and contained in pairwise quasi h-closedness. the characteristics and relationships concerning this new class ofspaces with other corresponding types are established. moreover, several ofits basic and important p...

Recently introduced by Abraham et. al, compact multicast routing algorithms construct point-to-multipoint routing paths from any source to any set of destinations. The present paper introduces a different approach by proposing a name-independent compact multicast routing algorithm that is leaf-initiated, fully distributed, and independent from the underlying unicast routing. By means of the pro...

It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortunately almost all of the theory of reinforcement learning assumes lookup table representations. In this paper we address the pressing issue of combining function approximation and RL, and present 1) a function approx-im...

This paper considers compact fault-tolerant routing schemes for weighted general graphs, namely, routing schemes that avoid a set of failed (or forbidden) edges. We present a compact routing scheme capable of handling multiple edge failures. Assume a source node s contains a message M designated to a destination target t and assume a set F of edges crashes (unknown to s). Our scheme routes the ...

It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning RL algorithms to real world problems Unfortunately almost all of the theory of reinforcement learning assumes lookup table representa tions In this paper we address the pressing issue of combining function approximation and RL and present a function approx imator ba...