Sciweavers

1754 search results - page 332 / 351
» Games with Incomplete Information
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
SIGCSE
2008
ACM
161views Education» more  SIGCSE 2008»
13 years 7 months ago
Improving retention and graduate recruitment through immersive research experiences for undergraduates
Research experiences for undergraduates are considered an effective means for increasing student retention and encouraging undergraduate students to continue on to graduate school...
Teresa A. Dahlberg, Tiffany Barnes, Audrey Rorrer,...
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 7 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh
TOG
2008
156views more  TOG 2008»
13 years 7 months ago
Real-time motion retargeting to highly varied user-created morphologies
Character animation in video games--whether manually keyframed or motion captured--has traditionally relied on codifying skeletons early in a game's development, and creating...
Chris Hecker, Bernd Raabe, Ryan W. Enslow, John De...
IJCIA
2002
137views more  IJCIA 2002»
13 years 7 months ago
Co-Evolution in Social Interactions
An interesting problem which has been widely investigated is under what circumstances will a society of rational agents realize some particular stable situations, and whether they ...
Hiroshi Sato, Akira Namatame