Sciweavers

1503 search results - page 274 / 301
» Generalized Parity Games
Sort
View
TCS
2008
13 years 10 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
TOG
2008
156views more  TOG 2008»
13 years 10 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...
JNW
2007
80views more  JNW 2007»
13 years 10 months ago
A New Method of Using Sensor Network for Solving Pursuit-Evasion Problem
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...
Peng Zhuang, Yi Shang, Hongchi Shi
AAMAS
2002
Springer
13 years 10 months ago
Multiagent Learning for Open Systems: A Study in Opponent Classification
Abstract. Open systems are becoming increasingly important in a variety of distributed, networked computer applications. Their characteristics, such as agent diversity, heterogenei...
Michael Rovatsos, Gerhard Weiß, Marco Wolf
ECCC
2010
106views more  ECCC 2010»
13 years 8 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria