Sciweavers

211 search results - page 4 / 43
» Solving Games Without Determinization
Sort
View
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 7 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar
CONCUR
2001
Springer
13 years 11 months ago
The Control of Synchronous Systems, Part II
Abstract. A controller is an environment for a system that achieves a particular control objective by providing inputs to the system without constraining the choices of the system....
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
CIG
2005
IEEE
14 years 22 days ago
How to Protect Peer-to-Peer Online Games from Cheats
Abstract- Recently, P2P (peer-to-peer) online game systems have attracted a great deal of public attention. They work without central servers, thus, the maintenance and organizatio...
Haruhiro Yoshimoto, Rie Shigetomi, Hideki Imai
JAL
2002
99views more  JAL 2002»
13 years 6 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
ICRA
2005
IEEE
169views Robotics» more  ICRA 2005»
14 years 21 days ago
Absolute Stereo SFM without Stereo Correspondence for Vision Based SLAM
— This paper presents a vision based SLAM method by using stereo SFM technique. The proposed method is based on the stereo SFM presented in our former paper. The method do not ne...
Jae-Hean Kim, Myung Jin Chung