Sciweavers

5243 search results - page 342 / 1049
» Reasoning About Strategies
Sort
View
ATAL
2008
Springer
15 years 8 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
ATAL
2010
Springer
15 years 8 months ago
Stackelberg vs. Nash in security games: interchangeability, equivalence, and uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
Zhengyu Yin, Dmytro Korzhyk, Christopher Kiekintve...
ICRA
2007
IEEE
160views Robotics» more  ICRA 2007»
16 years 1 months ago
Adaptive Sampling for Multi-Robot Wide-Area Exploration
— The exploration problem is a central issue in mobile robotics. A complete coverage is not practical if the environment is large with a few small hotspots, and the sampling cost...
Kian Hsiang Low, Geoffrey J. Gordon, John M. Dolan...
ICCV
2007
IEEE
16 years 8 months ago
Recovering Occlusion Boundaries from a Single Image
Occlusion reasoning, necessary for tasks such as navigation and object search, is an important aspect of everyday life and a fundamental problem in computer vision. We believe tha...
Derek Hoiem, Andrew N. Stein, Alexei A. Efros, Mar...
CADE
2005
Springer
16 years 7 months ago
Nominal Techniques in Isabelle/HOL
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
Christian Urban, Christine Tasson