Michael L. Littman Brown University / Bellcore Department of Computer Science Brown University Providence, RI 02912-1910 [email protected] Abstract One form of adaptive behavior is \goal-seeking" in which an agent acts so as to minimize the time it takes to reach a goal state. This paper presents some theoretical and empirical ndings on algorithms that devise goal-seeking behaviors for \mem...

This paper investigates the effectiveness of the Memoryless Simplification approach described by Lindstrom and Turk [14]. Like many polygon simplification methods, this approach reduces the number of triangles in a model by performing a sequence of edge collapses. It differs from most recent methods, however, in that it does not retain a history of the geometry of the original model during simp...

SFI Working Papers contain accounts of scienti5ic work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-­‐reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited v...

We consider a generalized memoryless property which relates to Cantor’s second functional equation, study its properties and demonstrate various examples.

We give a simple, direct, and constructive proof of memoryless determinacy for parity and mean payo& games. First, we prove by induction that the 8nite duration versions of these games, played until some vertex is repeated, are determined and both players have memoryless winning strategies. In contrast to the proof of Ehrenfeucht and Mycielski, Internat. J. Game Theory, 8 (1979) 109–113, our pr...

Power amplifiers (PAs) are inherently nonlinear elements and digital predistortion is a highly cost-effective approach to linearize them. Although most existing architectures assume that the PA has a memoryless nonlinearity, memory effects of the PAs in many applications ,such as wideband code-division multiple access (WCDMA) or orthogonal frequency-division multiplexing (OFDM), can no longer b...

It is shown that the encoding/decoding problem for any asynchronous -user discrete memoryless multiple-access channel can be reduced to corresponding problems for at most 2 1 single-user discrete memoryless channels. This result, which extends a similar result for Gaussian channels, reduces the seemingly hard task of finding good multiple-access codes to the much better understood task of findi...