Zobrazeno 1 - 10
of 138
pro vyhledávání: '"T. Bossomaier"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
CGIV
This paper describes an ongoing project to build a computer application that presents Einstein's theory of relativity in an interactive game environment. With the current interest in the use and study of how computer games can help teach and educate,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::407377237ec5baa0224f3d99f3a1fa51
https://doi.org/10.1109/cgiv.2007.35
https://doi.org/10.1109/cgiv.2007.35
Publikováno v:
CIG
The challenge of creating teams of agents, which evolve or learn, to solve complex problems is addressed in the combinatorially complex game of dots and boxes (strings and coins). Previous evolutionary reinforcement learning (ERL) systems approaching
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6ffa29b93a7c780d0402322806b06e7
https://doi.org/10.1109/cig.2007.368090
https://doi.org/10.1109/cig.2007.368090
Autor:
T. Bossomaier, D. van Raay
Publikováno v:
GMAI
Methods for simulating viscous liquid flows, such as volcanic lava, are developed for use in real-time interactive graphical applications such as computer games. Eulerian Lattice Boltzmann methods are implemented and compared to simpler models based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::030fa12a23fbe0ecbe7ae1513e837a16
https://doi.org/10.1109/gmai.2006.32
https://doi.org/10.1109/gmai.2006.32
Autor:
T. Bossomaier, Tarashankar Rudra
Publikováno v:
TENCON 2005 - 2005 IEEE Region 10 Conference.
This paper falls into the category of human computer interaction. Here the focus lies in injecting emotions into the non-player characters (NPC) in reaction to the emotion of the player in computer games. The idea of injecting emotion into games has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3400cc337385bbf22ce17743d0ff7dcf
https://doi.org/10.1109/tencon.2005.300854
https://doi.org/10.1109/tencon.2005.300854
Publikováno v:
ICITA (1)
This paper explores the characteristics of a new language for communication with game characters. This new language is called game pidgin language (GPL) (Rudra et al., 2003). A GPL is a sub-class of computer pidgin language (CPL) (Hinde and Belrose)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1e19144c7013e1735678d1bc32d189c
https://doi.org/10.1109/icita.2005.259
https://doi.org/10.1109/icita.2005.259
Publikováno v:
Proceedings. 1998 International Conference Software Engineering: Education and Practice (Cat. No.98EX220).
The paper looks at the development of groupware to maintain documents. The documents are specified by SGML DTDs. The SGML instances are maintained in generalized tree structures on either a single server or distributed servers maintaining sub trees.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::405ced86f7b5c1697c72000c8044bdd6
https://doi.org/10.1109/seep.1998.707647
https://doi.org/10.1109/seep.1998.707647
Publikováno v:
Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
Feed forward networks are used to carry out a simple classifi'cation task: determining the position and identity of a simple geometrical figures. Earlier work proposes computational efficiency as a rationale for the modular structure of the best such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::724dadb7f387ba2c9089debbbe4090bf
https://doi.org/10.1109/icec.1995.489144
https://doi.org/10.1109/icec.1995.489144
Autor:
T. Bossomaier, T. Potter
Publikováno v:
Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
Many transportation problems, such as the travelling salesman problem, are computationally hard but often solvable quickly, although with less certainty, by heuristic methods. Genetic algorithms fall into this category and generate results with favou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1b22e807cfe0acf769b724ed56c249a
https://doi.org/10.1109/icec.1995.487486
https://doi.org/10.1109/icec.1995.487486