In addition to regular paper submissions the conference offers four alternative types of paper submission: competition, vision, short and demo papers. Competition papers: These are regular papers up to 8 pages that describe one or more entries to the competitions that are running at this year's CIG. Competition papers need to include evaluation of the contribution.
Because the problem domain is well-known, these papers can be reviewed faster than regular papers. The same quality standards will apply to competition papers as to regular papers. The portal can access those files and use them to remember the user's data, such as their chosen settings screen view, interface language, etc.
By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service.
By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser. Submitting the report failed.
Please, try again. If the error persists, contact the administrator by writing to support infona. You can change the active elements on the page buttons and links by pressing a combination of keys:. I accept. Guiding play-outs has also been a focus of study in real-time games, such as Tron and Ms. Pacman, two games that have been objects of study in the past years. The authors found that, although MCTS works well, a significant number of random In the domain of real-time games, MCTS has been applied to different problems.
For instance, Samothrakis et al. Documents: Advanced Search Include Citations. Authors: Advanced Search Include Citations. St-pierre, Francis Maes, Damien Ernst. The fact that players have to react fast and that moves occur simult Abstract - Cited by 8 2 self - Add to MetaCart essentially known for their performance on turn-based games, such as Go, for which players have considerable time for choosing their moves.
The fact that players have to react fast and that moves occur simultaneously creates an unusual setting for MCTS, in which classical selection policies such as UCB1 may be suboptimal. Citation Context Alhejali, Simon M. In this paper, we use Monte Carlo Tree Search to create a Ms Pac-Man playing agent before using genetic programming to enhance its performance by evolving a new default policy to replace the random agent used in the simulations.
Contrary to most applications of MCTS to date, Ms Pac-Man requires almost real-time decision making and does not have a natural end state. We approached the problem by performing Monte-Carlo tree searches on a 5 player maxn tree representation of the game wi We approached the problem by performing Monte-Carlo tree searches on a 5 player maxn tree representation of the game with limited tree search depth.
I accept. Polski English Login or register account. Story representation in analogy-based story generation in Riu. Abstract Computational analogy offers a promising direction to algorithmically generating stories, a key challenge in computational narrative. Since analogy methods are very sensitive to the story representation being used, this paper focuses on story representation for analogy-based story generation. Specifically, we analyze existing story representation formalisms and propose a new approach based on the cognitive semantics theory of force dynamics.
Finally, we present the results of our analogy-based interactive narrative system, Riu, to illustrate the utility of our proposal. Authors Close. Assign yourself or invite other person as author.
0コメント