Sciweavers

309 search results - page 30 / 62
» Path coalitional games
Sort
View
NETGAMES
2006
ACM
14 years 1 months ago
Cellular automata and Hilditch thinning for extraction of user paths in online games
ÌÓ Ô ÓÒÐ Ò Ñ × ÒØ Ö ×Ø Ò ØÓ Ø Ö ÔÐ Ý Ö׸ Ø × Ñ¹ ÔÓÖØ ÒØ ØÓ Ø Ø ÔÐ Ý Ö׳ Ú ÓÖ׺ ÁÒ Ø × Ô Ô Ö¸ Ò ÓÖ Ö ØÓ ÙÒ Ö×Ø ...
Ruck Thawonmas, Masayasu Hirano, Masayoshi Kurashi...
IEEECIT
2010
IEEE
13 years 5 months ago
Optimized Application and Practice of A* Algorithm in Game Map Path-Finding
Huilai Zou, Lili Zong, Hua Liu, Chaonan Wang, Zeni...
CSL
2003
Springer
14 years 27 days ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 9 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
14 years 1 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail