616 research outputs found
Processor for high-density digital tape-recorded signals
Linear filter and detection theory can bear on problem of reconstructing recorded bit stream. Problem can be taken from realm of nonlinear problems even though basic record process is still recognized as highly nonlinear. Digital tape recorder can be modeled as particular type of linear communication channel with intersymbol interference
Automatic generation of level maps with the do what's possible representation
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Automatic generation of level maps is a popular form of automatic content generation. In this study, a recently developed technique employing the do what's possible representation is used to create open-ended level maps. Generation of the map can continue indefinitely, yielding a highly scalable representation. A parameter study is performed to find good parameters for the evolutionary algorithm used to locate high quality map generators. Variations on the technique are presented, demonstrating its versatility, and an algorithmic variant is given that both improves performance and changes the character of maps located. The ability of the map to adapt to different regions where the map is permitted to occupy space are also tested.Final Accepted Versio
The riddle of togelby
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.At the 2017 Artificial and Computational Intelligence in Games meeting at Dagstuhl, Julian Togelius asked how to make spaces where every way of filling in the details yielded a good game. This study examines the possibility of enriching search spaces so that they contain very high rates of interesting objects, specifically game elements. While we do not answer the full challenge of finding good games throughout the space, this study highlights a number of potential avenues. These include naturally rich spaces, a simple technique for modifying a representation to search only rich parts of a larger search space, and representations that are highly expressive and so exhibit highly restricted and consequently enriched search spaces. We treat the creation of plausible road systems, useful graphics, highly expressive room placement for maps, generation of cavern-like maps, and combinatorial puzzle spaces.Final Accepted Versio
EXPLANATION OF VARIATION IN DEMAND FOR FARM CREDIT IN MISSOURI
The study analyzed the demand for farm credit in Missouri. Results suggested that financial leverage, government payments, occupation of farm operators, average farm acreages, value of land and buildings and types of farm operation had significant influence on farm credit usage. The study highlighted the potential for credit rationing.Agricultural Finance,
Iterated Prisoner's Dilemma with Choice and Refusal of Partners
This article extends the traditional iterated prisoner's dilemma (IPD) with round-robin partner matching by permitting players to choose and refuse partners in each iteration on the basis of continually updated expected payoffs. Comparative computer experiments are reported that indicate the introduction of partner choice and refusal accelerates the emergence of mutual cooperation in the IPD relative to round-robin partner matching. Moreover, in contrast to findings for round-robin partner matching (in which the average payoffs of the players tend to be either clustered around the mutual cooperation payoff or widely scattered), the average payoff scores of the players with choice and refusal of partners tend to cluster into two or more distinct narrow bands. Preliminary analytical and computational sensitivity studies are also reported for several key parameters. Related work can be accessed here: http://www.econ.iastate.edu/tesfatsi/tnghome.htmiterated prisoner's dilemma; preferential partner selection; evolutionary game theory
Analyzing Social Network Structures in the Iterated Prisoner's Dilemma with Choice and Refusal
The Iterated Prisoner's Dilemma with Choice and Refusal (IPD/CR) is an
extension of the Iterated Prisoner's Dilemma with evolution that allows players
to choose and to refuse their game partners. From individual behaviors,
behavioral population structures emerge. In this report, we examine one
particular IPD/CR environment and document the social network methods used to
identify population behaviors found within this complex adaptive system. In
contrast to the standard homogeneous population of nice cooperators, we have
also found metastable populations of mixed strategies within this environment.
In particular, the social networks of interesting populations and their
evolution are examined.Comment: 37 pages, uuencoded gzip'd Postscript (1.1Mb when gunzip'd) also
available via WWW at http://www.cs.wisc.edu/~smucker/ipd-cr/ipd-cr.htm
On the application of extreme-value statistics to command oriented problems
Extreme value theory for estimating statistical parameters of spacecraft communication system
Application of the statistical theory of extreme values to spacecraft receivers
Statistical theory of extreme values application to spacecraft communication receiver
- …