Sciweavers

849 search results - page 9 / 170
» Search allocation game
Sort
View
AAAI
1996
13 years 10 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
IAT
2006
IEEE
14 years 3 months ago
Resolution-Based Policy Search for Imperfect Information Differential Games
Differential games (DGs), considered as a typical model of game with continuous states and non-linear dynamics, play an important role in control and optimization. Finding optimal...
Minh Nguyen-Duc, Brahim Chaib-draa
ATAL
2009
Springer
14 years 3 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 10 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
IANDC
2008
85views more  IANDC 2008»
13 years 9 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse