Sciweavers

1599 search results - page 94 / 320
» Algorithms for Parity Games
Sort
View
AAAI
2008
15 years 2 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
ICC
2007
IEEE
146views Communications» more  ICC 2007»
15 years 6 months ago
Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network
–Retransmission based schemes are not suitable for energy constrained wireless sensor networks. Hence, there is an interest in including parity bits in each packet for error cont...
Saad B. Qaisar, Shirish S. Karande, Kiran Misra, H...
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
15 years 9 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
ATAL
2011
Springer
13 years 11 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
SSS
2009
Springer
107views Control Systems» more  SSS 2009»
15 years 6 months ago
A Self-stabilizing Algorithm for Graph Searching in Trees
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
Rodica Mihai, Morten Mjelde