Sciweavers

2588 search results - page 22 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
MSWIM
2006
ACM
15 years 5 months ago
Performance modeling of critical event management for ubiquitous computing applications
A generic theoretical framework for managing critical events in ubiquitous computing systems is presented. The main idea is to automatically respond to occurrences of critical eve...
Tridib Mukherjee, Krishna M. Venkatasubramanian, S...
ECAI
2006
Springer
15 years 2 months ago
Cheating Is Not Playing: Methodological Issues of Computational Game Theory
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...
Bruno Beaufils, Philippe Mathieu
CCS
2011
ACM
13 years 11 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
AAAI
2010
15 years 20 days ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
GRAMMARS
2002
119views more  GRAMMARS 2002»
14 years 11 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an