Sciweavers

800 search results - page 132 / 160
» On the Complexity of Parity Games
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga
IOR
2002
179views more  IOR 2002»
13 years 8 months ago
Decision Analysis: A Personal Account of How It Got Started and Evolved
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...
Howard Raiffa
ECCC
2010
106views more  ECCC 2010»
13 years 7 months ago
Hardness of Parameterized Resolution
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
Olaf Beyersdorff, Nicola Galesi, Massimo Lauria
JAIR
2010
115views more  JAIR 2010»
13 years 7 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
CVPR
2011
IEEE
13 years 23 days ago
Activity Recognition using Dynamic Subspace Angles
Cameras are ubiquitous everywhere and hold the promise of significantly changing the way we live and interact with our environment. Human activity recognition is central to under...
Octavia Camps, Mario Sznaier, Binlong Li, Teresa M...